Page 573 - Computer science 868 Class 12
P. 573
24 if(ar[j]<ar[p]) // finding smallest
25 p=j;
26 }
27 return p;
28 }
29 void sort() //swapping the variables
30 {
31 for(int i=0;i<n;i++)
32 {
33 int x=index_of_min(i); // calling method
34 int t=ar[i]; // swapping
35 ar[i]=ar[x];
36 ar[x]= t;
37 }
38 }
39 void display()
40 {
41 for(int i=0;i<n;i++)
42 System.out.print(ar[i]+" | ");
43 }
44 public static void main()
45 {
46 Selection_sort ob=new Selection_sort();
47 ob.read_list();
48 System.out.println("THE UNSORTED ARRAY IS :-");
49 ob.display();
50 ob.sort();
51 System.out.print("\nTHE SORTED ARRAY IS :-");
52 ob.display();
53 } //end of main
54 }
Output of the preceding program is as follows:
ENTER SIZE OF THE ARRAY
ENTER ARRAY ELEMENTS
2
571
Internal Assessment 571

