Default order in set in c++

6.29
include <iostream>
#include <iomanip>
using namespace std;

bool isPrimeHalf(int number)
{
	for (int i = 2; i <= number / 2; i++)
		if ((number % i) == 0)
			return false;
	return true;
}

bool isPrimeRoot(int number)
{
	for (int i = 2; i <= sqrt(static_cast<float>(number)); i++)
		if ((number % i) == 0)
			return false;
	return true;
}

int main()
{
	cout << "All primes between 2 and 1000 is: " << endl;
	for (int number = 2; number <= 100000; number++)
	{
		if (isPrimeHalf(number))
			cout << setw(8) << number;
	}
	cout << endl;
	cout << "And now same with other function: " << endl;
	for (int number = 2; number <= 100000; number++)
	{
		if (isPrimeHalf(number))
			cout << setw(8) << number;
	}
	cout << endl;

Default order in set in c++

ascending order

Similar codes

2 votes118 views1 answer
Cannot find -lsqlite3 C++ compiler error
C++
2 votes131 views1 answer
Print a string with printf in c++
C++
0 vote131 views1 answer
For auto map C
C++
7 votes133 views2 answers
Min heap stl
C++
0 vote123 views1 answer
How to use mersenne_twister_engine in c++ to generate random numbers
C++
0 vote128 views1 answer
Getline vs cin.getline
C++
0 vote134 views1 answer
Codeforces Round #376 (Div. 2), problem: (A) Night at the Museum
C++
19 votes141 views3 answers
File reading c++
C++
2 votes117 views1 answer
How to create a structure c++
C++
0 vote134 views1 answer
What does catch(...) mean in c++
C++