Quicksort is a popular and often faster sorting algorithm that uses a divide-and-conquer strategy to sort data by dividing arrays into smaller arrays. It was developed by Charles Antony Richard and works by selecting the first element as a pivot, scanning and comparing elements to find the first less than the pivot and interchanging it, then applying this process recursively to sublists until a sorted array is produced.

1. Topic:
Quick Sort

2. What is quicksort?
Quicksort is a popular sorting algorithm that
is often faster, compared to Other
sorting algorithms.
It utilizes a divide-and-conquer strategy to
quickly sort data items by dividing a large
array into two smaller arrays.
It was developed by Charles Antony Richard.

3. Process:
Suppose A is an unsorted Array having 12 elements.
Select the first number FIRST in the list, beginning with
the last number in the list, scan from right to left,
comparing with each number and stopping at the first
number less than FIRST. Then interchange the two
number.

4. Process of sorting

5. Applying these process in First sub list and second
sub list We will get the final Sorted array.