Reja: kirish I. Bob. Saralash algoritimi haqida tushuncha

#include "stdafx.h"
#include
#include
#include
using namespace std;
void choicesSort(int*, int); // tanlash tartiblash funktsiyasi prototipi
int main(int argc, char* argv[])
{
srand(time(NULL));
setlocale(LC_ALL, "rus");
cout << "Massivni o’lchamini kiriting: ";
int size_array; // massivni uzunligi
cin >> size_array;
int *sorted_array = new int [size_array]; // bir o’lchamli dinamik massiv
for (int counter = 0; counter < size_array; counter++)
{
sorted_array[counter] = rand() % 100; // qatorni tasodifiy raqamlar bilan to'ldiring
cout << setw(2) << sorted_array[counter] << " "; // massivni ekranga chiqarish
}
cout << "\n\n";
choicesSort(sorted_array, size_array); // saralash funktsiyasini tanlov bo'yicha qo'ng'iroq qiling 
for (int counter = 0; counter < size_array; counter++)
{
cout << setw(2) << sorted_array[counter] << " "; // tartiblangan qatorni chop etish
}
cout << "\n";
delete [] sorted_array; // xotirani bo'shatish
system("pause");
return 0;
}
void choicesSort(int* arrayPtr, int length_array) // tanlov saralash
{
for (int repeat_counter = 0; repeat_counter < length_array; repeat_counter++)
{
int temp = arrayPtr[0]; // almashtirish qiymatini saqlash uchun vaqtinchalik o'zgaruvchi
for (int element_counter = repeat_counter + 1; element_counter < length_array; element_counter++)
{
if (arrayPtr[repeat_counter] > arrayPtr[element_counter])
{
temp = arrayPtr[repeat_counter];
arrayPtr[repeat_counter] = arrayPtr[element_counter];