Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.ArrayList;
- /* BASEADO NOS SLIDES AED7 */
- public class QuickSort {
- private static final int CUTOFF = 10;
- public void quicksort(ArrayList <Palavra> vetor, int p, int r) {
- if (p < r) {
- int q = partition(vetor, p, r);
- quicksort(vetor, p, q);
- quicksort(vetor, q + 1, r);
- }
- }
- public int partition(ArrayList <Palavra> vetor, int p, int r) {
- int x = vetor.get(p).getOcorrencias(); // pivot
- int i = p;
- int j = r;
- while (true) {
- while (vetor.get(i).getOcorrencias() > x) {
- i++;
- }
- while (vetor.get(j).getOcorrencias() < x) {
- j--;
- }
- if (i < j) {
- Palavra temp = vetor.get(i);
- vetor.set(i, vetor.get(j));
- vetor.set(j, temp);
- i++;
- j--;
- } else {
- return j;
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement