FilesExpand file tree

 master

/

KuaiSuSort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

56 lines (47 loc) · 1.23 KB

 master

/

KuaiSuSort.java

Copy path

Top

File metadata and controls

• Code
• Blame

56 lines (47 loc) · 1.23 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

package com.oxy.sort;

import java.util.Arrays;

/**

* 快速排序

* @author oxy

*/

public class KuaiSuSort {

public static void main(String[] args) {

int[] sourceArray = {105,10,1, 3, 8,5, 4, 8, 6, 9, 10};

int[] arr = sort(sourceArray);

for (int num : arr) {

System.out.print(num + " ");

}

}

public static int[] sort(int[] sourceArray) {

// 赋值数组，避免改变源数组

int[] arr = Arrays.copyOf(sourceArray, sourceArray.length);

return quickSort(arr,0,arr.length-1);

}

private static int[] quickSort(int[] arr, int left, int right) {

if(left >= right){

return arr;

}

int i ,j ,temp;

i = left;

j = right;

temp = arr[left];

while (i < j){

while (arr[j] >= temp && i < j){

j--;

}

while (arr[i] <= temp && i < j){

i++;

}

if(i < j){

int t = arr[i];

arr[i] = arr[j];

arr[j] = t;

}

}

arr[left] = arr[i];

arr[i] = temp;

quickSort(arr,left,i-1);

quickSort(arr,j+1,right);

return arr;

}

}