3-Laboratoriya ishidan Xisoboti

O‘ZBEKISTON RESPUBLIKASI AXBOROT TEXNOLOGIYALARI VA KOMMUNIKATSIYALARINI RIVOJLANTIRISH VAZIRLIGI

MUHAMMAD AL-XORAZMIY NOMIDAGI
TOSHKENT AXBOROT TEXNOLOGIYALARI UNIVERSITETI

Algoritmlarni loyihalash fanidan

Abdullayev Muxammadalining yozgan

3-Laboratoriya ishidan

Xisoboti

Berilgan variant bo’yicha C++ (Python, Java) tilida har uchala saralash metodini bajaring va jadval shaklida solishtirib analiz qiling.

Birinchi topshiriq bo’yicha variantlar

Ro’yhat bo’yicha variant nomeri	Massivni to’ldirish	Saralash metodi	Har bir metod uchun massivdagi elementlarning soni
1,2,3	Tasodifiy elementlar bilan to’ldirilgan massiv	Sanash Pufakchali Shell	300	1200	4000

Saralashda Sanash usuli

Kiritilgan sondan kattalarini chciqarish

#include

using namespace std;

int main(){

int n,m;

cout<<"massiv elementlar sonini kiritng ";cin>>n;

cout<<"m sonini kiritng ";cin>>m;

int a[n];

srand(time(NULL));

for (int i=0;i

a[i]=rand ()% 999*2 - 999;cout<

}cout<

bool bor=false;

for(int i:a){

if(i>m) {cout<

}

}

if (!bor) cout<



Pufakchali saralash

#include

using namespace std;

void swap(int *xp, int *yp)

{

int temp = *xp;

*xp = *yp;

*yp = temp;

}

void bubbleSort(int arr[], int n)

{

int i, j;

for (i = 0; i < n-1; i++)

for (j = 0; j < n-i-1; j++)

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

swap(&arr[j], &arr[j+1]);

}

void printArray(int arr[], int size)

{

int i;

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

cout << arr[i] << " ";

cout << endl;

}

int main()

{

int arr[] = {64, 34, 25, 12, 22, 11, 90};

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

bubbleSort(arr, n);

cout<<"Saralangan massiv: \n";

printArray(arr, n);

return 0;

}