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 vote172 views1 answer
Google test assert eq float
C++
8 votes172 views3 answers
Stack implementation using class in c++
C++
0 vote179 views1 answer
Overloading IO Stream
C++
15 votes165 views4 answers
C++ random
C++
0 vote172 views1 answer
F && T || !(T) && F
C++
4 votes170 views2 answers
Long pi in c++
C++
0 vote177 views1 answer
Arduino buildin let
C++
1 vote164 views1 answer
Union of two arrays leetcode
C++
0 vote181 views1 answer
C++ double is nan
C++
1 vote162 views1 answer
64 bit unsigned integer c++
C++