In the last three posts we looked at selection, bubble and insertion sort respectively. While it’s critical to know these basic sorting techniques, it’s unlikely you’d be asked to code one of these up for your next Microsoft/Google interview unless …
Read MoreIn the last post we looked at how to really understand Bubble Sort by solving it on paper, one step at a time. We’ll take the same approach for Insertion Sort.
As with most fundamental sorting algorithms, the chances of …
Read MoreIn the last post we looked at how to really understand Selection Sort by solving it on paper, one step at a time. We’ll take the same approach for Bubble Sort.
While bubble sort is not one of the algorithms …
Read MoreThis is the first post in a series where we look at various sorting algorithms you’ll need to know for your next coding interview.
I struggled with understanding basic sorting algorithms when i first encountered them in college. I tried …
Read MoreGenerate binary numbers from 1 to any given number, “n”, using a queue.
List<string> GenerateBinaryNumber(int n)
n = 1 => (1)
n = 3 => ( 1, 10, 11)
Assuming …
Read More