Quicksort for arraylist

public static ArrayList<Vehicle> quickSort(ArrayList<Vehicle> list)
{
    if (list.isEmpty()) 
        return list; // start with recursion base case
    ArrayList<Vehicle> sorted;  // this shall be the sorted list to return, no needd to initialise
    ArrayList<Vehicle> smaller = new ArrayList<Vehicle>(); // Vehicles smaller than pivot
    ArrayList<Vehicle> greater = new ArrayList<Vehicle>(); // Vehicles greater than pivot
    Vehicle pivot = list.get(0);  // first Vehicle in list, used as pivot
    int i;
    Vehicle j;     // Variable used for Vehicles in the loop
    for (i=1;i<list.size();i++)
    {
        j=list.get(i);
        if (j.compareTo(pivot)<0)   // make sure Vehicle has proper compareTo method 
            smaller.add(j);
        else
            greater.add(j);
    }
    smaller=quickSort(smaller);  // capitalise 's'
    greater=quickSort(greater);  // sort both halfs recursively
    smaller.add(pivot);          // add initial pivot to the end of the (now sorted) smaller Vehicles
    smaller.addAll(greater);     // add the (now sorted) greater Vehicles to the smaller ones (now smaller is essentially your sorted list)
    sorted = smaller;            // assign it to sorted; one could just as well do: return smaller

    return sorted;
}

Source: stackoverflow.com

Similar codes

0 vote223 views1 answer
How to draw a circle in java swing
Java
19 votes250 views4 answers
Minecraft start bat
Java
0 vote221 views1 answer
Call method of another class without creating instance in java android
Java
0 vote223 views1 answer
Selenium java control + enter
Java
0 vote230 views1 answer
Spring websocket allow origin
Java
0 vote227 views1 answer
Plus One Java
Java
0 vote219 views1 answer
Java suppress warnings rawtypes
Java
0 vote225 views1 answer
Java array sortieren
Java
2 votes220 views1 answer
System.arraycopy
Java
0 vote214 views1 answer
Java application running other app
Java