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

2 votes224 views2 answers
C++ convert int to cstring
C++
0 vote239 views1 answer
Three-way comparison c++
C++
0 vote211 views1 answer
C++ if else if
C++
9 votes237 views9 answers
Selection sort
C++
1 vote234 views1 answer
Check if intent has extras
C++
1 vote219 views1 answer
Std::string to qstring
C++
0 vote239 views1 answer
Fill 2-dimensional array with value
C++
0 vote247 views1 answer
Glm multiply vector by scalar
C++
1 vote244 views2 answers
Read comma separated text file in c++
C++
1 vote234 views2 answers
C++ inherit from class template
C++