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 vote120 views1 answer
Pointer in cpp details
C++
0 vote120 views2 answers
Function prototype c++
C++
0 vote110 views1 answer
What is the default include path in ubuntu c++
C++
0 vote75 views1 answer
C++ include a file in another directory
C++
3 votes129 views3 answers
Get first element of set c++
C++
1 vote123 views1 answer
C++ power
C++
8 votes119 views4 answers
C++ max and min of vector
C++
15 votes114 views10 answers
Hello world
C++
1 vote121 views1 answer
Separation between paragraphs latex
C++
5 votes109 views1 answer
Qt debug
C++