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 vote337 views3 answers
Minimum characters to make string palindrome
C++
1 vote262 views1 answer
Sjfoajf;klsjflasdkfjk;lasjfjajkf;dslafjdjalkkkjakkkkkkkkkkkkkkkkfaWZdfbhjkkkk gauds
C++
0 vote271 views1 answer
What does catch(...) mean in c++
C++
0 vote275 views1 answer
Random key generator c++ all unique characters
C++
1 vote266 views1 answer
Cpp float to string
C++
0 vote288 views1 answer
Partition in STL using vector
C++
90 votes378 views5 answers
Tostring c++
C++
0 vote276 views1 answer
Move elements from vector to unordered_set
C++
2 votes284 views3 answers
Vector with initial size
C++
-1 vote277 views1 answer
Equal elements in two arrays in c++
C++