/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 theartofmachinery.com
Why Sorting is O(N log N) - The Art of Machinery
| | blog.paulhankin.net
Everything you know about complexity is wrong
3.6 parsecs away

Travel
| | Programming, Computer Science, Games and Other Things
| | fbeedle.com
Discrete Mathematics and Functional Programming
4.9 parsecs away

Travel
| | This book provides a distinct way to teach discrete mathematics. Since discrete mathematics is crucial for rigorous study in computer science, many texts include applications of mathematical topics to computer science or have selected topics of particular interest to computer science.
| | www.philipotoole.com
The power of sorting | Vallified
4.0 parsecs away

Travel
| | [AI summary] The article discusses the importance of sorting algorithms in computer science, explaining how they solve fundamental problems like finding extremes, detecting duplicates, and enabling binary search, while comparing specific algorithms like mergesort, heapsort, and counting sort based on their trade-offs.
| | schmidhuberj.de
Dynamic graphs | Schmiddi
21.9 parsecs away

Travel
| In this blog post, I will talk about dynamic graphs, which will be the area of work in which I will start writing my master's thesis soon. While this blog post will be more mathematical than any of my other blog posts so far, I tried to make everything as beginner-friendly as possible. Even if you don't have any knowledge about theoretical computer science, or you are just getting started, this blog post should be understandable.