Talk Binary

Insertion Sort is sorting algorithm similar to Bubble Sort simply because they are basic sorting algorithms. The difference, is that Insertion Sort iterates through the data structure selects an element and inserts it into its correct location until no elements are left to sort. Insertion Sort Visual Example 26 5 12 -6 First Iteration The [...]

Binary Search is a method to search through a sorted container in order to find a particular value. Remember that one “Guess the Number” game? Let’s look at the following scenario by applying the Binary Search algorithm in order for you to understand how Binary Search works. The Guessing Game Pick a number from 0 [...]

Bubble Sort Algorithm Bubble sort is the most primitive sorting algorithm. It simply iterates through a list and compares two elements and swaps them to put them in order. It repeats this process until no more swaps are made. Why Bubble Sort you may ask? You can think of the algorithm as “bubbling” the largest [...]