-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBasicSorting.java
More file actions
78 lines (74 loc) · 2.09 KB
/
Copy pathBasicSorting.java
File metadata and controls
78 lines (74 loc) · 2.09 KB
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
import java.util.*;
public class BasicSorting {
public static void bubbleSort(int arr[]) {
for(int turn=0; turn<arr.length-1; turn++){
for(int j=0; j<arr.length-1-turn; j++){
if(arr[j]> arr[j+1]){
//swap
int temp= arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
}
public static void printArr(int arr[]){
for (int i=0; i<arr.length;i++){
System.out.print(arr[i]+ " ");
}
System.out.println();
}
public static void selectionSort(int arr[]){
for(int i=0; i<arr.length-1; i++){
int minPos=1;
for(int j=i+1;j<arr.length;j++){
if(arr[minPos]> arr[j]){
minPos=j;
}
}
//swap
int temp=arr[minPos];
arr[minPos]=arr[i];
arr[i]=temp;
}
}
public static void insertionSort(int arr[]){
for(int i=1; i<arr.length-1; i++){
int curr=arr[i];
int prev=i-1;
//finding out the correct pos to insert
while(prev>=0 && arr[prev] > curr){
arr[prev +1]=arr[prev];
prev--;
}
//insertion
arr[prev+1]=curr;
}
}
public static void countingSort(int arr[]){
int largest =Integer.MIN_VALUE;
for(int i=0; i< arr.length; i++){
largest=Math.max(largest, arr[i])
}
int count[]= new int[largest+1];
for(int i=0; i<arr.length; i++){
count[arr[i]]++;
}
//sorting
int j=0;
for(int i=0; i<count.length;i++){
while(count[i]>0){
arr[j]=i;
j++;
count[i]--;
}
}
}
public static void main(String args[]){
int arr[]={5,4,1,3,2};
// insertionSort(arr);
// Arrays.sort(arr,0,3);
countingSort(arr);
printArr(arr);
}
}