## Tackling Entropy

I've heard the term "entropy" over the years and never understood it until now. I used to think entropy was randomness, and it's kind of related. »

I've heard the term "entropy" over the years and never understood it until now. I used to think entropy was randomness, and it's kind of related. »

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 »

Time management can be tough. I found myself spending way too long on some subjects. Some take more time than others. Graphs, trees and sorting take »

I wanted to clarify the programming language requirement for the interview. I was under the impression that I needed C++ or Java to do the interview, »

I needed this for myself, and Googled around but didn't find anything satisfactory, but now after a little work, I'm all set with Valgrind. Wouldn't you »

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 »

I've been learning graphs and dynamic programming somewhat interleaved. Dynamic programming tends to help solve graph problems because: Every problem solvable by dynamic programming can be »

I put on my sorting hat and watched many, many videos on sorting. The videos covered: bubble sort selection sort insertion sort heap sort merge sort »

Technically, I started reading in April, but look at that stack! I'm not spending too much time reading on a daily basis right now. I want »

Splay trees are very simple as far as structure. A splay tree a binary search tree, so each node has a key, maybe a left child, »