Quick Sort Example

• QuickSort is a Divide and Conquer algorithm like Merge Sort. It picks an element as pivot and partitions the given array around the picked pivot. There are many different versions of quickSort that pick pivot in different ways such as always pick first element as pivot, always pick last element as pivot, pick a random element as pivot, pick median as pivot
• This java example shows how to sort an element of Java ArrayList using Quick Sort method of Collections class.

The objective of Program

• The program firstly assign some values including person's atttributes to its object and performs sort process in terms of each attribute title. All sort process is implemented by Turkish alphabetical order.

Files contaning in this repository

• src
  • quicksort
    • QuickSortProcess.java
  • main
    • Main.java
  • model
    • Person.java
  • util
    • DefineValues.java
    • ShowProcess.java

Explaining an inforamtion of each file

Files Names	Information
QuickSortProcess.java	Implementing QuickSort Sort Process by Turkish alphabetical order
Person.java	Defining it as a POJO
Main.java	Handle with all project files to run the program
ShowProcess.java	Showing all information about Person Object as output
DefineValues.java	Filling its attributes into Person Object