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 vote127 views1 answer
C++ overwrite file
C++
2 votes115 views1 answer
Unordered_map of pair and int
C++
1 vote128 views3 answers
If c++
C++
0 vote125 views1 answer
Youtube to facebook link converter
C++
0 vote143 views2 answers
Qpushbutton clicked connect c++
C++
0 vote120 views1 answer
Is there garbage collection in c++
C++
1 vote150 views1 answer
Multithreading
C++
0 vote131 views1 answer
C+ - Dormir en millisecondes
C++
0 vote124 views1 answer
Deal with bad input cpp
C++
6 votes86 views1 answer
Rng cpp
C++