Sort Algorithm Comparison Chart
.NET introsort vs LINQ stable OrderBy, comparator rules (never a - b), 0/1 vs unbounded knapsack-style iteration, counting sort, and external merge sort for data > RAM.
See: Sort Algorithm Comparison Chart
The architecture as diagrams, so you can hold the whole system in your head.
Reading Sorting Algorithms is free. Pro unlocks the other four modes on all Algorithms & Data Structures topics, so you can go from understanding it to building it.
- SeeThe architecture as diagrams, so you can hold the whole system in your head.
- AnimateStep through the flow one stage at a time and watch the data move.
- TestScenario questions with explanations that show exactly where your model of it breaks.
- BuildA guided implementation with code you can run and adapt for production.
Continue reading
All Algorithms & DS articles →Dijkstra in C#: PriorityQueue, A*, and Why Negative Edges Break It
Production Dijkstra with .NET PriorityQueue and the skip-stale pattern, path reconstruction, A* with admissible heuristics, multi-source variants, and Bellman-Ford for negatives.
Graph Traversal: BFS, DFS, Topological Sort, and the Visited Set
Adjacency list vs matrix, BFS for unweighted shortest path, DFS recursive vs iterative, Kahn's topological sort, three-colour cycle detection, and connected components.
Trees: BSTs, Balance, and Why SortedDictionary Is Red-Black
BST vs self-balancing (red-black, AVL), B-trees in databases, heaps with PriorityQueue, tries for prefix queries, and iterative traversals that don't blow the stack.
Discussion
Sign in to share your feedback and join the discussion.