Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public static User[] sort(User[] users, int start, int end) {
- if (start >= end) {
- return users;
- }
- int i = start;
- int j = end;
- int opor = i - (i - j) / 2;
- while (i < j){
- while (i < opor && comparator(users[i].getName(), users[opor].getName()) == 0){
- i++;
- }
- while (j > opor && comparator(users[opor].getName(), users[j].getName()) == 0){
- j--;
- }
- if (i < j) {
- swap(users, i, j);
- if (i == opor) {
- opor = j;
- } else if (j == opor) {
- opor = i;
- }
- }
- }
- sort(users, 0, opor);
- sort(users, opor + 1, end);
- return users;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement