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 vote103 views1 answer
Hola mundo c++
C++
3 votes121 views2 answers
Search in vector of pairs c++
C++
2 votes103 views1 answer
How to interface c++ in haxe
C++
0 vote120 views1 answer
Basic stack implementation in c++
C++
0 vote126 views1 answer
C++ meaning ::
C++
1 vote110 views1 answer
How to send email in c++ program
C++
0 vote130 views1 answer
C++ how to skip the last element of vector
C++
1 vote154 views1 answer
Parallelize for loop c++
C++
0 vote123 views3 answers
Options select from array
C++
3 votes94 views2 answers
Find kth max and min element in an array
C++