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

19 votes246 views1 answer
C++ writing to file
C++
0 vote254 views1 answer
Find the max element along with it's index in c++
C++
0 vote241 views1 answer
What does sultion mean in a particle model
C++
1 vote267 views2 answers
Rotate array cpp
C++
0 vote250 views1 answer
Ue4 endoverlap c++
C++
0 vote233 views1 answer
Print pattern and space in cpp
C++
0 vote248 views1 answer
Pragma cpp
C++
0 vote241 views3 answers
C to c++ online converter
C++
0 vote248 views2 answers
If else in C++
C++
6 votes246 views2 answers
Strcmp
C++