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

28 votes261 views4 answers
C++ vector remove element by value
C++
1 vote270 views1 answer
C++ check if cin didn't get int
C++
7 votes292 views6 answers
Sort a vector c++
C++
0 vote238 views1 answer
C++ while loop decrement
C++
0 vote237 views9 answers
Convert c++ to python online
C++
0 vote269 views1 answer
Bash find into array
C++
0 vote286 views1 answer
How to create a custom event in ue4 c++
C++
4 votes206 views2 answers
Escape sequence in c++
C++
1 vote242 views1 answer
C++ lock
C++
3 votes244 views1 answer
Stl library c++ header
C++