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

1 vote144 views1 answer
Eosio check account exist
C++
0 vote144 views1 answer
What is push() c++
C++
1 vote158 views1 answer
G++ -wall option meaning
C++
1 vote136 views1 answer
Union cpp
C++
11 votes108 views1 answer
Strcmp different length
C++
7 votes157 views2 answers
Count number of char in a string c++
C++
11 votes139 views2 answers
C++ get ascii value of char
C++
0 vote143 views1 answer
Cout alternative c++
C++
1 vote157 views1 answer
Cpp map iterate over keys
C++
0 vote87 views2 answers
Average of vector c++
C++