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 vote333 views1 answer
Find last digit of number
C++
25 votes410 views6 answers
String to int c++
C++
8 votes329 views1 answer
Arduino for command
C++
0 vote365 views1 answer
Stl
C++
0 vote348 views1 answer
Run c++ program in mac terminal
C++
19 votes322 views1 answer
Dev c++
C++
0 vote325 views1 answer
Log base 10 c+_+
C++
0 vote344 views1 answer
Use uint in c++
C++
10 votes391 views3 answers
C++ check if file exits
C++
0 vote390 views1 answer
Split 2d array into chunks in c++
C++