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

-1 vote113 views3 answers
Convert python code to java
Java
0 vote117 views1 answer
Rxjava dependencies
Java
17 votes121 views10 answers
Time
Java
-1 vote127 views1 answer
Java runtime.getruntime().exec
Java
1 vote116 views1 answer
How to read a string after an integer in java
Java
1 vote122 views1 answer
Initialize hashset with values java 9
Java
76 votes115 views3 answers
For loop javasctip
Java
0 vote120 views1 answer
Java notnull returns null
Java
0 vote107 views1 answer
Instance block in java
Java
0 vote121 views1 answer
Jlabel text grösse
Java