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 vote165 views1 answer
Java to puthon converter
C++
1 vote142 views1 answer
Parallelize for loop c++
C++
97 votes275 views6 answers
Change int to string c++
C++
0 vote154 views1 answer
Pop off end of string c++
C++
0 vote146 views1 answer
C++ get pointer from unique_ptr
C++
0 vote142 views1 answer
How to add numbers in c++
C++
-1 vote191 views1 answer
How to replace an element in array in c++
C++
0 vote133 views1 answer
Binary search c++
C++
0 vote154 views1 answer
Decimal to binary gfg
C++
4 votes146 views3 answers
Check lowercase letters c++
C++