Sorting and Searching alGOrithms
summary
Go implementations of quicksort and binary search with working code plus unit tests and benchmarks that prove performance. Examples include quicksort partition with slice headers and an observed 183 ns/op quicksort benchmark over millions of runs and larger timings up to ~57,000 ns at 1,000 items. Testing uses Go test tables and benchmarking via testing.B; validation includes stress tests with 1000 randomized arrays to catch off by one and correctness issues.
AI-written summary · about
chapters (6)
- 0:00Start
- 3:42Sorting Algorithms
- 11:08Quicksort Test
- 14:28Quicksort Benchmark
- 17:14Binary Search Test
- 17:27Binary Search Stress Test
related talks
24m"Discovery of Worst Case Go Sort Inputs"
50mFun with Algorithms and Data Structures
14mOptimizing Go code without a blindfold
07mMiles to Go: Golang for Competitive Programming?
21mFunctional Go?
28mBuilding a Cutting Edge Search Engine in Go
26mPractical Memory Profiling
20mOptimizing Go code without a blindfold