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 vote159 views4 answers
C++ for loop syntax
C++
0 vote127 views1 answer
Two D Arrays
C++
3 votes188 views2 answers
Last element of a set in c++
C++
0 vote169 views1 answer
C++ split string by comma
C++
1 vote163 views1 answer
C++ milliseconds
C++
-1 vote186 views1 answer
Intersection between vector c++
C++
0 vote175 views2 answers
How to compile with libstdc++ fedora
C++
3 votes166 views1 answer
C++ how to make a negative float positive
C++
12 votes163 views3 answers
How to get input in cpp
C++
-1 vote150 views1 answer
Assigning a seed on a random number generator in C++
C++