-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathNewSort.java
More file actions
33 lines (27 loc) · 834 Bytes
/
NewSort.java
File metadata and controls
33 lines (27 loc) · 834 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
public class NewSort {
void sort(int arr[])
{
int n = arr.length;
// One by one move boundary of unsorted subarray
for (int i = 0; i < n-1; i++)
{
// Find the minimum element in unsorted array
int min_idx = i;
for (int j = i+1; j < n; j++)
if (arr[j] < arr[min_idx])
min_idx = j;
// Swap the found minimum element with the first
// element
int temp = arr[min_idx];
arr[min_idx] = arr[i];
arr[i] = temp;
}
}
public static void main(String[] args) {
// TODO Auto-generated method stub
int arr= {3,5,2,34,12,6};
NewSort obj = new NewSort();
obj.sort(arr);
System.out.print(arr);
}
}