Sorting is a foundational concept in computer science and a common operation in many applications. Different sorting algorithms have various time and space complexities, and understanding these different algorithms can help you choose the best one for your specific needs. In this article, we will cover three popular sorting algorithms and illustrate how to implement them in Python.

Sorting AlgorithmTime Complexity (Average)Time Complexity (Worst)In-PlaceStableImplementation Complexity
Bubble SortO(n^2)O(n^2)YesYesLow
Quick SortO(n log n)O(n^2)YesNoMedium
Merge SortO(n log n)O(n log n)NoYesMedium
  • Bubble Sort: A simple sorting algorithm that compares and swaps adjacent elements. It has low implementation complexity but it’s not efficient for large lists.
  • Quick Sort: An efficient sorting algorithm that uses a divide-and-conquer approach with a pivot element. Although it’s not stable, it’s usually more efficient than Bubble Sort, especially for large lists.
  • Merge Sort: An efficient and stable sorting algorithm that also uses a divide-and-conquer approach. It’s suitable for large data sets, but it requires additional space for the temporary arrays during the sorting process.

1. Bubble Sort

Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. The pass through the list is repeated until the list is sorted. Bubble Sort has a worst-case and average time complexity of O(n^2), where n is the number of items being sorted.

Python code:

def bubble_sort(arr):
    n = len(arr)
    for i in range(n):
        for j in range(0, n - i - 1):
            if arr[j] > arr[j + 1]:
                arr[j], arr[j + 1] = arr[j + 1], arr[j]
arr = [64, 34, 25, 12, 22, 11, 90]
print("Sorted array is:", arr)

2. Quick Sort

Quick sort is a highly efficient sorting algorithm that uses a divide-and-conquer strategy. It works by selecting a ‘pivot’ element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. It then recursively sorts the sub-arrays. The time complexity of Quick Sort is O(n^2) in the worst case scenario when the list is already sorted, but the average case time complexity is O(n log n).

Python code:

def partition(arr, low, high):
    i = low - 1
    pivot = arr[high]
    for j in range(low, high):
        if arr[j] <= pivot:
            i = i + 1
            arr[i], arr[j] = arr[j], arr[i]
    arr[i + 1], arr[high] = arr[high], arr[i + 1]
    return i + 1
def quick_sort(arr, low, high):
    if len(arr) == 1:
        return arr
    if low < high:
        pi = partition(arr, low, high)
        quick_sort(arr, low, pi - 1)
        quick_sort(arr, pi + 1, high)
arr = [10, 7, 8, 9, 1, 5]
n = len(arr)
quick_sort(arr, 0, n - 1)
print("Sorted array is:", arr)

3. Merge Sort

Merge sort is an efficient, reliable sorting algorithm that applies the divide-and-conquer principle. It begins by splitting the unsorted list into n sublists, where each sublist consists of a single element and is therefore considered sorted. Following this, it repeatedly merges the sublists to form new sorted sublists until there is only one remaining. This remaining sublist is the sorted list. The worst-case time complexity of Merge Sort is O(n log n), making it a suitable choice for large data sets.

Python code:

def merge_sort(arr):
    if len(arr) > 1:
        mid = len(arr) // 2
        Left_half = arr[:mid]
        Right_half = arr[mid:]
        i = j = k = 0
        # Merge data back into original array
        while i < len(Left_half) and j < len(Right_half):
            if Left_half[i] < Right_half[j]:
                arr[k] = Left_half[i]
                i += 1
                arr[k] = Right_half[j]
                j += 1
            k += 1
        # Checking if any element was left
        while i < len(Left_half):
            arr[k] = Left_half[i]
            i += 1
            k += 1
        while j < len(Right_half):
            arr[k] = Right_half[j]
            j += 1
            k += 1
arr = [12, 11, 13, 5, 6, 7]
print("Sorted array is:", arr)

In conclusion, Bubble Sort, Quick Sort, and Merge Sort are all valuable sorting algorithms, each with its own merits and limitations. Bubble Sort is a simple and intuitive algorithm, but it tends not to perform as well on larger lists. Quick Sort is usually more efficient, but its performance can vary depending on the pivot selection. Merge Sort offers efficiency and performs well on larger lists, but it requires additional space for the temporary arrays during the sorting process.

Having a good understanding of these different sorting algorithms helps you choose the most fitting one for your specific task. Always consider the nature of the data you’re sorting, as well as the requirements of your use case, when selecting a sorting algorithm.


We, at London Data Consulting (LDC), provide all sorts of Data Solutions. This includes Data Science (AI/ML/NLP), Data Engineer, Data Architecture, Data Analysis, CRM & Leads Generation, Business Intelligence and Cloud solutions (AWS/GCP/Azure).

For more information about our range of services, please visit: https://london-data-consulting.com/services

Interested in working for London Data Consulting, please visit our careers page on https://london-data-consulting.com/careers

More info on: https://london-data-consulting.com

Write a Reply or Comment

Your email address will not be published. Required fields are marked *