I thought I was done reading books for the learning phase of my study process, and was itching to get back to the coding problems phase. But something was missing. I had read several books and watched months worth of videos, and the code I had seen along the way was C, Java, C++, but not too much…
Read more
Yes, you can sort in linear time, as long as you’re avoiding comparisons. Radix sort and counting sort are two examples. They both avoid comparisons, and are possible because they sort based on grouping by a single element at a time, where that single element is a letter or digit (in…
Read more
Greed is good. And Dijkstra’s algorithm is greedy. Dijkstra’s algorithm not only calculates the shortest (lowest weight) path on a graph from source vertex S to destination V, but also calculates the shortest path from S to every other vertex. My implementation in Python doesn’t…
Read more