SecondThread's blog

By SecondThread, history, 3 months ago, In English

Episode 0 of Algorithms Dead is out now! It covers the Hungarian algorithm and how to do dijkstra's in just v^2 instead of e*log(e). Usually e*log(e) is fine, but v^2 is obviously faster on a complete or nearly-complete graph.

Other than recording where my mouse is so you can see what I am pointing to, if you have any suggestions for the future, feel free to let me know!

 
 
 
 
  • Vote: I like it
  • +102
  • Vote: I do not like it

»
3 months ago, # |
  Vote: I like it +11 Vote: I do not like it

A small thing: the camera is a little choppy while the computer screen is smooth.

The content is nice and I like the name of the show. lol

»
6 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Any blog from where I can read the whole explanation ?