This Project is to be done in java coding.
Your task is to implement quicksort using linked lists instead of arrays. The version in the book,
using arrays, is faster, but this version is simpler. Use the first element as pivot. Write a
function that takes an integer N and a list L of integers and returns a list of all members of L t
hat are <= N -- the small list. Write a similar function that returns members of L > N - the big list.
Recursively sort these lists. Put the pivot in front of the sorted big list, append the sorted small
list to the front, and return the result. The outward behavior of the program is simple: read integers
until you get a -1, then sort and return the results.
quicksort result: 1 5 9