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 vote311 views2 answers
Shortest path in unweighted graph bfs
C++
0 vote340 views1 answer
C++ void to avoid functions
C++
3 votes303 views2 answers
Lambda function in c++
C++
17 votes337 views4 answers
Max element in vector c++
C++
0 vote283 views10 answers
Convert c++ code to c online
C++
0 vote293 views1 answer
Generate random ints and floats
C++
8 votes337 views2 answers
C++ factorial
C++
1 vote334 views1 answer
For loop vector
C++
0 vote309 views2 answers
Or in c++
C++
0 vote363 views1 answer
C++ get maximum value unsigned int
C++