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 vote354 views5 answers
Memset in c++
C++
6 votes374 views6 answers
If statement C++
C++
0 vote335 views1 answer
Lexene token pairs of java codes
C++
0 vote341 views1 answer
Gamemaker studio
C++
0 vote301 views1 answer
How to pronounce beaucoup
C++
0 vote339 views1 answer
Youtube to facebook link converter
C++
-1 vote306 views1 answer
Assigning a seed on a random number generator in C++
C++
0 vote317 views1 answer
Flake8 max line length
C++
1 vote341 views1 answer
Why are inline keyword in header c++
C++
0 vote310 views1 answer
Are arrays faster than vectors c++
C++