Toshkent axborot texnologiy

O‘ZBEKISTON RESPUBLIKASI AXBOROT TEXNOLOGIYALARI VA KOMMUNIKATSIYALARINI RIVOJLANTIRISH VAZIRLIGI

MUHAMMAD AL-XORAZMIY NOMIDAGI

TOSHKENT AXBOROT TEXNOLOGIYALARI UNIVERSITETI

“Algoritmlarni loyihalash”

fanidan

Laboratoriya №1

Bajardi: CAL016-L3-guruh talabasi

Qodirov Qodirbergan

Tekshirdi: Karaxanova Shirin

Toshkent 2020
Mavzu: Ma’lumotlarni saralash algoritmlarining murakkabligini tahlil qilish.

Ustuvor navbatlar.

1-Topshiriq.
Surish saralash
#include

#include

#include

using namespace std;

int main(){

int n;

cout<<"Massiv olchamini kiriting :"; cin>>n;

int mas[n];

for(int i=0;i

mas[i]=rand()%98+1;

}

cout<<"tasodifiy sonlar"<

for(int i=0;i

cout<

}

cout<

for(int i=0;i

for(int j=0;j

if(mas[j]>mas[j+1])

swap(mas[j],mas[j+1]);

}

}

cout<<"saralangan sonlar"<

for(int i=0;i

cout<

}

}

Natijasi

Tezkor saralash
#include

using namespace std;

void swap(int* a, int* b)

{

int t = *a;

*a = *b;

*b = t;

}

int partition (int mas[], int low, int high)

{

int pivot = mas[high];

int i = (low - 1);

for (int j = low; j <= high - 1; j++)

{

if (mas[j] < pivot)

{

i++;

swap(&mas[i], &mas[j]);

}

}

swap(&mas[i + 1], &mas[high]);

return (i + 1);

}

void quickSort(int mas[], int low, int high)

{

if (low < high)

{

int pi = partition(mas, low, high);

quickSort(mas, low, pi - 1);

quickSort(mas, pi + 1, high);

}

}

void masDispley(int mas[], int size)

{

int i;

for (i = 0; i < size; i++)

cout << mas[i] << " ";

cout << endl;

}

int main()

{

int m;

cout<<"massiv olchamini kiriting: "; cin>>m;

int mas[m];

for(int i=0;i

mas[i]=rand()%98+1;

}

cout<<"tasodifiy sonlar"<

for(int i=0;i

cout<

}

cout<

int n = sizeof(mas) / sizeof(mas[0]);

quickSort(mas, 0, n - 1);

cout << "Saralangan massiv: \n";

masDispley(mas, n);

return 0;

}

Natijasi: