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 vote325 views1 answer
Why the << operator is friend
C++
4 votes326 views2 answers
Sqrt cpp
C++
3 votes331 views3 answers
C++ get char of string
C++
-2 votes328 views1 answer
C++ constant
C++
0 vote348 views1 answer
Remove decimal c++
C++
0 vote356 views1 answer
Intage1 was not declared in this scope C++
C++
0 vote340 views1 answer
How to save system function output into a variable in c++
C++
4 votes341 views3 answers
REFERENCE C++
C++
3 votes340 views1 answer
C++ how to make a negative float positive
C++
0 vote342 views1 answer
Prime factorisation of a number in c++
C++