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 vote252 views1 answer
Waiting in a serial as the spool reflect the queue operation. Demonstrate Printer Behavior in context of Queue.Subject to the Scenario implement the Pop and Push Using C++.
C++
4 votes237 views1 answer
Eosio multi index secondary index
C++
-1 vote246 views1 answer
Equal elements in two arrays in c++
C++
1 vote261 views1 answer
Heap c++ stl
C++
1 vote201 views2 answers
To kill
C++
0 vote239 views1 answer
Set keybinding for compiling c++ program in neovim
C++
1 vote270 views1 answer
Shout sharkest
C++
2 votes276 views5 answers
How to sort a vector
C++
-1 vote247 views1 answer
Attention nlp
C++
0 vote249 views1 answer
Txt to pdf CPP
C++