FilesExpand file tree

 master

/

Quicksort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

49 lines (38 loc) · 1.05 KB

 master

/

Quicksort.java

Copy path

Top

File metadata and controls

• Code
• Blame

49 lines (38 loc) · 1.05 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

package org.study;

public class Quicksort {

public static void main(String[] args) {

int[] arr = { 3, 9, 20, 1, 6, 5 };

// 배열a, 배열의 시작, 배열의 끝

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

for (Integer a : arr)

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

}

static void swap(int[] a, int idx1, int idx2) {

int tmp = a[idx1];

a[idx1] = a[idx2];

a[idx2] = tmp;

}

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

int pl = left;

int pr = right;

int pivot = arr[(pl + pr) / 2]; // pivot

do {

// pivot보다 작은것 , pivot, pivot보다 큰것

// 해당 규칙에 위배되는 index를 찾는다.

while (arr[pl] < pivot)

pl++;

while (arr[pr] > pivot)

pr--;

System.out.println("pl=" + pl + " pr=" + pr + " x=" + pivot);

if (pl <= pr)

swap(arr, pl++, pr--);

for (Integer a : arr)

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

System.out.println();

} while (pl <= pr);

if (left < pr)

quickSort(arr, left, pr);

if (right > pl)

quickSort(arr, pl, right);

}

}