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 vote143 views1 answer
How to find the class of an object java
Java
0 vote154 views1 answer
What is return method in java
Java
0 vote159 views1 answer
Java virtual override
Java
0 vote159 views1 answer
Javafx rectangle border size
Java
0 vote162 views1 answer
Play mp3 android java
Java
0 vote182 views1 answer
Fibonacci numbers using Recursion in Java
Java
0 vote165 views1 answer
Android view set padding programmatically
Java
0 vote159 views1 answer
SwipeRefreshLayout
Java
-1 vote158 views1 answer
Compile java code with package in cmd
Java
37 votes163 views4 answers
Queue in java
Java