FilesExpand file tree

 master

/

Person_quick.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

44 lines (37 loc) · 1.01 KB

 master

/

Person_quick.java

Copy path

Top

File metadata and controls

• Code
• Blame

44 lines (37 loc) · 1.01 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

package sort;

import java.util.Arrays;

import java.util.Comparator;

import sort.Person;

import sort.PersonNameComparator;

public class Person_quick {

static void swap(Object[]a,int i, int j) {

Object temp=a[i];

a[i]=a[j];

a[j]=temp;

}

static<T> int partition(T[]a,int start, int end,Comparator<T> comparator) {

T value=a[end];//기준값

int i=start-1;

for(int j=start;j<=end-1;++j) {

if(comparator.compare(a[j],value)>0) {

swap(a,++i,j);

}

}

swap(a,i+1,end);

return i+1;

}

static <T> void quickSort(T[]a,int start, int end,Comparator<T> comparator) {

if(start>=end)return;

int middle=partition(a,start,end,comparator);

quickSort(a,start,middle-1,comparator);

quickSort(a,middle+1,end,comparator);

}

public static void main(String[]args) {

Person[]a= new Person[] {

new Person("김지혜",23),new Person("루비",35), new Person("엄마",47),

new Person("김하얀",20)

};

quickSort(a,0,a.length-1,new PersonNameComparator());

System.out.println(Arrays.toString(a));

}

}