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 vote123 views1 answer
Iterate const vector
C++
0 vote122 views1 answer
Convert char to C
C++
3 votes114 views1 answer
C++ check if string contains uppercase
C++
0 vote128 views1 answer
Cuda shared variable
C++
0 vote81 views1 answer
Interest rate parity
C++
0 vote130 views1 answer
Counting Sort C++
C++
0 vote121 views1 answer
Dfs program in c++
C++
13 votes123 views3 answers
? in cpp
C++
0 vote131 views1 answer
Cpp loop through object
C++
0 vote119 views1 answer
C++ handling
C++