This will introduce you to Sorting in Python and help you understand the importance of Sorting. This Python tutorial will take you through various Sorting Algorithms. The Algorithms are lined after one another, starting with Bubble Sort moving to Insertion Sort, Merge Sort, and finally Quick Sort. The demonstration examples will educate you on Sorting Algorithms.

2. What’s In It For You?
• What is Sorting in Python?
• Importance of Sorting
• Sorting Algorithms
• Bubble Sort
• Insertion Sort
• Merge Sort
• Quick Sort

3. What is Sorting in Python?
Sorting refers to arranging available data in a particular format
Example:
Arranging or sorting a list L1 in descending order;
L1 = [2,4,6,7,3,1,5,9,8]
L1 = [9,8,7,6,5,4,3,2,1]

4. Importance of Sorting
Searches for an item in a list is made faster and easier with
sorting
Sorting is also used to represent data in more readable
formats
Sorting helps locate various patterns in the data
Duplicate values can be found in a list very quickly when the
list is sorted

5. Sorting Algorithms
Python’s Built-In Sorting method - sorted()
By default, the sorted() method sorts the list in ascending
order
L1 = [2,4,6,7,3,1,5,9,8]
L1 = [1,2,3,4,5,6,7,8,9]

6. Sorting Algorithms
Bubble Sort
• In Bubble Sort Algorithm, the first element is compared with the adjacent
element.
• If the adjacent element is smaller than the first element, the elements are
swapped.
• The algorithm then compares the second element with its adjacent element
and the process continues to bubble the largest element to the right side of the
list and finally sorts the list in ascending order.

7. Bubble Sort
L1 = [2,,6,7,3,1,5,9,8]
6
8
9 4 6
9
8 4
9
6
8 4
4
6
8 9
4
8
6 9 8
4
6 9
8
6
4 9

8. Sorting Algorithms
Insertion Sort
Insertion sort places a given element at the right position in a sorted list. So, in
the beginning, we compare the first two elements and sort them by comparing
them
Then we pick the third element and find its proper position among the last two
sorted elements. This process continues till all elements land in their proper
positions

9. Insertion Sort
L1 = [2,,6,7,3,1,5,9,8]
8
6
4 9
6
8
4 9
6
4
8 9
6
4
8 9

10. Sorting Algorithms
Merge Sort
Merge sort is a Divide and Conquer algorithm
Merge sort first divides the list into equal parts and then sorts the parts and unites
them as a sorted list

11. Merge Sort
L1 = [2,,6,7,3,1,5,9,8]
8
6
4 9
6
4
8 9
8 4 6 9
8 4 6 9
4 8 6 9

12. Sorting Algorithms
Quick Sort
First, you choose a pivot element in the array. Then stores elements less than
pivot in left subarray and elements greater than pivot in right subarray and all this
is done in linear time
After that, we will call quicksort on the left subarray and similarly, we will call
quicksort on the right subarray
Quicksort is also a Divide and Conquer algorithm

13. Sorting Algorithms
6
5 3 7 6 4 10
5 3 7 6 4 10
5 3 7 6 4 10
5 3 7 6 4 10
Determine pivot and start pointer at left
and right
Since 5<6, shift left pointer
Since 3<6, shift left pointer. Since 7>6
stop
Since 10>6, shift right pointer. Since
4<6 stop

14. Sorting Algorithms
5 3 4 6 7 10
5 3 7 6 4 10
5 3 7 6 4 10
Swap values at pointers
Move pointers one more step
Since 6==6, move pointers one more
step. Stop

15. INDIA
Simplilearn Solutions Pvt. Limited
#53/1C, 24th Main, 2nd Sector
HSR Layout, Bangalore 560102
Phone: +91 8069999471
UNITED STATES
Simplilearn Solutions Pvt. Limited
801 Corporate Center Drive, Suite 138
Raleigh, NC 27607
Phone: (919) 205-5565
UNITED STATES
Simplilearn Solutions Pvt. Limited
201 Spear Street, Suite 1100
San Francisco, CA 94105
Phone: (415) 741-3319
Join us to learn more!