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 vote290 views1 answer
Log base 10 c+_+
C++
3 votes300 views2 answers
Find kth max and min element in an array
C++
4 votes302 views1 answer
C++ show time elapsed
C++
0 vote288 views1 answer
Qt widget list set selected
C++
1 vote306 views1 answer
Use of undeclared identifier 'unique_ptr'
C++
9 votes283 views5 answers
C++ cin cout
C++
2 votes338 views1 answer
Rng c++
C++
0 vote319 views1 answer
Inbuilt function for bin to dec in c++
C++
0 vote403 views1 answer
Passing 2d array by reference c++
C++
2 votes293 views1 answer
C++ terminal color
C++