3-Laboratoriya ishi Topshirdi: Narzullayeb Javohir
Download 345.57 Kb.
|
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
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 {
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); } }
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 {
System.out.println("---Array AFTER Bubble Sort---"); outArray(a); }
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];
}
|
ma'muriyatiga murojaat qiling