-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathArraysort.java
More file actions
59 lines (40 loc) · 1.29 KB
/
Arraysort.java
File metadata and controls
59 lines (40 loc) · 1.29 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
package IntrotoDSwithJava;
import java.util.Arrays;
public class Arraysort {
int[] selectsort(int[] arr){
int start = 0;
int end = arr.length;
while(start < end){
for(int i = start; i < end;i++){
if(arr[i] < arr[start]) swap(arr,i,start);
System.out.println(String.format( "Start: %d, i: %d",start,i));
}
start++;
}
return arr;
}
private void swap(int[] arr, int i, int start){
int temp = arr[i];
arr[i] = arr[start];
arr[start] = temp;
}
void mergesort(int[] arr,int start,int end){
if(start < end) {
int mid = (start + end)/2;
mergesort(arr,start,mid);
mergesort(arr,mid+1,end);
merge(arr,start,mid,mid+1,end);
}
}
int[] merge(int[] arr,int leftstart,int leftend, int rightstart,int rightend){
return arr;
}
public static void main(String[] args) {
int[] arr = {40,29,1,4,5,2,8,9,31,12,21};
Thread.dumpStack();
System.out.println();
Arraysort sort = new Arraysort();
System.out.println(Arrays.toString(Thread.currentThread().getStackTrace()));
System.out.println(Arrays.toString(sort.selectsort(arr)));
}
}