AlgorithmsPractice/QuickSortIterative.java at master · jigsaw004/AlgorithmsPractice · GitHub

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
importjava.util.Arrays;
importjava.util.Stack;

publicclassSolution{

publicstaticvoidmain(Stringargs[]){
int[] arr = {1,2,1,1,1};
QuickSort(arr,0,arr.length-1);
System.out.println(Arrays.toString(arr));
	}
publicstaticvoidQuickSort(int[] arr, intlow, inthigh){
Stack<Integer> st = newStack<Integer>();
st.push(low);
st.push(high);
intl,h;
while(!st.isEmpty()){
h = st.pop();
l = st.pop();
if(l < h){
intp = partition(arr,l,h);
st.push(l); st.push(p-1);
st.push(p+1); st.push(h);
 }
 }
	}

publicstaticintpartition(int[] arr, intlow, intpivot){
inti = low-1;
for(intj = low; j < pivot; j++){
if(arr[j] < arr[pivot]){
i++;
swap(arr,i,j);
 }
 }
swap(arr,++i,pivot);
returni;
	}

publicstaticvoidswap(int[] arr, inti, intj){
inttemp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
	}

}
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
importjava.util.Arrays;
importjava.util.Stack;

publicclassSolution{

publicstaticvoidmain(Stringargs[]){
int[] arr = {1,2,1,1,1};
QuickSort(arr,0,arr.length-1);
System.out.println(Arrays.toString(arr));
	}
publicstaticvoidQuickSort(int[] arr, intlow, inthigh){
Stack<Integer> st = newStack<Integer>();
st.push(low);
st.push(high);
intl,h;
while(!st.isEmpty()){
h = st.pop();
l = st.pop();
if(l < h){
intp = partition(arr,l,h);
st.push(l); st.push(p-1);
st.push(p+1); st.push(h);
 }
 }
	}

publicstaticintpartition(int[] arr, intlow, intpivot){
inti = low-1;
for(intj = low; j < pivot; j++){
if(arr[j] < arr[pivot]){
i++;
swap(arr,i,j);
 }
 }
swap(arr,++i,pivot);
returni;
	}

publicstaticvoidswap(int[] arr, inti, intj){
inttemp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
	}

}
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
importjava.util.Arrays;
importjava.util.Stack;

publicclassSolution{

publicstaticvoidmain(Stringargs[]){
int[] arr = {1,2,1,1,1};
QuickSort(arr,0,arr.length-1);
System.out.println(Arrays.toString(arr));
	}
publicstaticvoidQuickSort(int[] arr, intlow, inthigh){
Stack<Integer> st = newStack<Integer>();
st.push(low);
st.push(high);
intl,h;
while(!st.isEmpty()){
h = st.pop();
l = st.pop();
if(l < h){
intp = partition(arr,l,h);
st.push(l); st.push(p-1);
st.push(p+1); st.push(h);
 }
 }
	}

publicstaticintpartition(int[] arr, intlow, intpivot){
inti = low-1;
for(intj = low; j < pivot; j++){
if(arr[j] < arr[pivot]){
i++;
swap(arr,i,j);
 }
 }
swap(arr,++i,pivot);
returni;
	}

publicstaticvoidswap(int[] arr, inti, intj){
inttemp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
	}

}
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
importjava.util.Arrays;
importjava.util.Stack;

publicclassSolution{

publicstaticvoidmain(Stringargs[]){
int[] arr = {1,2,1,1,1};
QuickSort(arr,0,arr.length-1);
System.out.println(Arrays.toString(arr));
	}
publicstaticvoidQuickSort(int[] arr, intlow, inthigh){
Stack<Integer> st = newStack<Integer>();
st.push(low);
st.push(high);
intl,h;
while(!st.isEmpty()){
h = st.pop();
l = st.pop();
if(l < h){
intp = partition(arr,l,h);
st.push(l); st.push(p-1);
st.push(p+1); st.push(h);
 }
 }
	}

publicstaticintpartition(int[] arr, intlow, intpivot){
inti = low-1;
for(intj = low; j < pivot; j++){
if(arr[j] < arr[pivot]){
i++;
swap(arr,i,j);
 }
 }
swap(arr,++i,pivot);
returni;
	}

publicstaticvoidswap(int[] arr, inti, intj){
inttemp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
	}

}
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
importjava.util.Arrays;
importjava.util.Stack;

publicclassSolution{

publicstaticvoidmain(Stringargs[]){
int[] arr = {1,2,1,1,1};
QuickSort(arr,0,arr.length-1);
System.out.println(Arrays.toString(arr));
	}
publicstaticvoidQuickSort(int[] arr, intlow, inthigh){
Stack<Integer> st = newStack<Integer>();
st.push(low);
st.push(high);
intl,h;
while(!st.isEmpty()){
h = st.pop();
l = st.pop();
if(l < h){
intp = partition(arr,l,h);
st.push(l); st.push(p-1);
st.push(p+1); st.push(h);
 }
 }
	}

publicstaticintpartition(int[] arr, intlow, intpivot){
inti = low-1;
for(intj = low; j < pivot; j++){
if(arr[j] < arr[pivot]){
i++;
swap(arr,i,j);
 }
 }
swap(arr,++i,pivot);
returni;
	}

publicstaticvoidswap(int[] arr, inti, intj){
inttemp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
	}

}
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
importjava.util.Arrays;
importjava.util.Stack;

publicclassSolution{

publicstaticvoidmain(Stringargs[]){
int[] arr = {1,2,1,1,1};
QuickSort(arr,0,arr.length-1);
System.out.println(Arrays.toString(arr));
	}
publicstaticvoidQuickSort(int[] arr, intlow, inthigh){
Stack<Integer> st = newStack<Integer>();
st.push(low);
st.push(high);
intl,h;
while(!st.isEmpty()){
h = st.pop();
l = st.pop();
if(l < h){
intp = partition(arr,l,h);
st.push(l); st.push(p-1);
st.push(p+1); st.push(h);
 }
 }
	}

publicstaticintpartition(int[] arr, intlow, intpivot){
inti = low-1;
for(intj = low; j < pivot; j++){
if(arr[j] < arr[pivot]){
i++;
swap(arr,i,j);
 }
 }
swap(arr,++i,pivot);
returni;
	}

publicstaticvoidswap(int[] arr, inti, intj){
inttemp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
	}

}
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
importjava.util.Arrays;
importjava.util.Stack;

publicclassSolution{

publicstaticvoidmain(Stringargs[]){
int[] arr = {1,2,1,1,1};
QuickSort(arr,0,arr.length-1);
System.out.println(Arrays.toString(arr));
	}
publicstaticvoidQuickSort(int[] arr, intlow, inthigh){
Stack<Integer> st = newStack<Integer>();
st.push(low);
st.push(high);
intl,h;
while(!st.isEmpty()){
h = st.pop();
l = st.pop();
if(l < h){
intp = partition(arr,l,h);
st.push(l); st.push(p-1);
st.push(p+1); st.push(h);
 }
 }
	}

publicstaticintpartition(int[] arr, intlow, intpivot){
inti = low-1;
for(intj = low; j < pivot; j++){
if(arr[j] < arr[pivot]){
i++;
swap(arr,i,j);
 }
 }
swap(arr,++i,pivot);
returni;
	}

publicstaticvoidswap(int[] arr, inti, intj){
inttemp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
	}

}
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
importjava.util.Arrays;
importjava.util.Stack;

publicclassSolution{

publicstaticvoidmain(Stringargs[]){
int[] arr = {1,2,1,1,1};
QuickSort(arr,0,arr.length-1);
System.out.println(Arrays.toString(arr));
	}
publicstaticvoidQuickSort(int[] arr, intlow, inthigh){
Stack<Integer> st = newStack<Integer>();
st.push(low);
st.push(high);
intl,h;
while(!st.isEmpty()){
h = st.pop();
l = st.pop();
if(l < h){
intp = partition(arr,l,h);
st.push(l); st.push(p-1);
st.push(p+1); st.push(h);
 }
 }
	}

publicstaticintpartition(int[] arr, intlow, intpivot){
inti = low-1;
for(intj = low; j < pivot; j++){
if(arr[j] < arr[pivot]){
i++;
swap(arr,i,j);
 }
 }
swap(arr,++i,pivot);
returni;
	}

publicstaticvoidswap(int[] arr, inti, intj){
inttemp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
	}

}