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

0 vote301 views2 answers
Or in c++
C++
0 vote310 views1 answer
Kmp c++
C++
-2 votes309 views2 answers
C++ for
C++
1 vote297 views1 answer
How to create a pair of double quotes in c++
C++
2 votes336 views1 answer
How to use python sleep function on c++
C++
72 votes355 views4 answers
C++ vector pop first element
C++
2 votes307 views3 answers
Cpp compiler online
C++
1 vote330 views1 answer
Fibonacci series in c++ Recursive
C++
0 vote285 views1 answer
C++ add everything in a vector
C++
0 vote299 views3 answers
Mm
C++