3-Laboratoriya ishi Topshirdi: Narzullayeb Javohir

SelectionSort(Tanlash orqali qidiruv)

2.1.Selection Sort qidiruv da esa bu bubbleSort ga qaraganda katta o’lchamdagi qiymatlarni saralash bu qidiruvda bir muncha tez va samarali

O(n^2)

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 Selection Sort---");
outArray(a);
selectionSort(a);

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

outArray(a);

}

public static void selectionSort(int[] arr){

for (int i = 0; i < arr.length - 1; i++) {
int index = i;
for (int j = i + 1; j < arr.length; j++){
if (arr[j] < arr[index]){
index = j;//searching for lowest index
}
}
int smallerNumber = arr[index];
arr[index] = arr[i];
arr[i] = smallerNumber;
}
}

static void outArray(int[] array) {

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