Sorting and Hash Tables — Python

A guide to understanding how Hash Tables can be used in Python.

Photo by Kelly Sikkema on Unsplash

SORTING

• It is the re-arranging of items in an array.
• [13,5,2,9] -> [2,5,9,13] after sorting.
• Most of the sorting algorithms in a worst-case scenario take O(n log n) time complexity.

EXAMPLE