Richmond Alake

Updated on November 16, 2023

Bubble sort is a sorting algorithm that uses comparison methods to sort an array. It has an average time complexity of O(n^2). Here’s what you need to know.

Richmond Alake

Updated on April 05, 2023

Heap sort is a sorting algorithm that organizes elements in an array into a binary heap, and then sorts that heap by moving the largest element in the array. Here’s how to implement it in Python.  

Richmond Alake

Updated on January 19, 2023

Understand the basics behind the technique cosine similarity that is used across different fields and domains of machine learning.