3-Laboratoriya ishi Topshirdi: Narzullayeb Javohir


Download 345.57 Kb.
bet1/2
Sana03.06.2020
Hajmi345.57 Kb.
#113770
  1   2
Bog'liq
3-lab-Algoritm.13-variant


O‘ZBEKISTON RESPUBLIKASI AXBOROT TEXNOLOGIYALARI VA KOMMUNIKATSIYALARINI RIVOJLANTIRISH VAZIRLIGI

MUHAMMAD AL-XORAZMIY NOMIDAGI

TOSHKENT AXBOROT TEXNOLOGIYALARI UNIVERSITETI

Algoritmlashni loyihalash fanidan

3-Laboratoriya ishi

Topshirdi: Narzullayeb Javohir

13-Variant



13,14,15

Tasodifiy elementlar bilan to’ldirilgan massiv

O’rniga qo’yish

Pufakchali

Tanlash


350

2000

6000

BubbleSort(Pufakchali qidiruv)

1.O(n)-Bu qidiruvda qidiruv cheksiz davom etadi yoki ko`p vaqt sarflaydi.Shu bilan birga bu qidiruv kichik o’lchamdagi ro`yhatdan qidirish uchun qulay

public class DemoApplication {
public static void main(String[] args) {
// SpringApplication.run(DemoApplication.class, args);
Scanner scanner=new Scanner(System.in);
int a[]=new int[350];
Random rn=new Random(10);
for (int i = 0; i a[i]=rn.nextInt(10);
}
System.out.println("---Array BEFORE Bubble Sort---");
outArray(a);
bubleSort(a);

System.out.println("---Array AFTER Bubble Sort---");


outArray(a);

}

static void bubleSort(int[] array) {


int n = array.length;
int temp = 0;
for(int i=0; i < n; i++)
for(int j=1; j < (n-i); j++)
{
System.out.println("Comparing "+ array[j-1]+ " and " + array[j]);
if(array[j-1] > array[j]) {
temp = array[j-1];
array[j-1] = array[j];
array[j] = temp;
System.out.println(array[j] + " is greater than " + array[j-1]);
System.out.println("Swapping Elements: New Array After Swap");
outArray(array);
}

}
}
static void outArray(int[] array) {


for(int i=0; i < array.length; i++) {
System.out.print(array[i] + " ");
}
System.out.println();
};
};

1.1-O(n^2) Bu qidiruvda amalimiz tezlashadi va bir muncha vaqtda yutamiz

public class DemoApplication {
public static void main(String[] args) {
// SpringApplication.run(DemoApplication.class, args);
Scanner scanner=new Scanner(System.in);
int a[]=new int[6000];
Random rn=new Random(10);
for (int i = 0; i a[i]=rn.nextInt(10)+1;
}
System.out.println("---Array BEFORE Bubble Sort---");
outArray(a);
bubbleSort(a,a.length);

System.out.println("---Array AFTER Bubble Sort---");


outArray(a);

}
//Eng qulay uslub kata qiymatlar bilan ishlayotganda


public static void bubbleSort(int [] sort_arr, int len){

for (int i=0;i

for(int j=0;j

if(sort_arr[j+1]

int swap = sort_arr[j];
sort_arr[j] = sort_arr[j+1];
sort_arr[j+1] = swap;

}
}
}


}
static void outArray(int[] array) {
for(int i=0; i < array.length; i++) {
System.out.print(array[i] + " ");
}
System.out.println();
};
};




Download 345.57 Kb.

Do'stlaringiz bilan baham:
  1   2




Ma'lumotlar bazasi mualliflik huquqi bilan himoyalangan ©fayllar.org 2024
ma'muriyatiga murojaat qiling