Uploaded January 2024 | Updated September 2026, 2 hours ago
How do computer scientists know one algorithm is more efficient than another one? They can use two methods. Benchmark testing is the most common, but when benchmarks are unavailable they can use something known as run-time complexity. This is not intended to be an in-depth dive into the topic, and you will find links to sources I thought explained it better in the video itself.
How do computer scientists know one algorithm is more efficient than another one? They can use two methods. Benchmark testing is the most common, but when benchmarks are unavailable they can use something known as run-time complexity. This is not intended to be an in-depth dive into the topic, and you will find links to sources I thought explained it better in the video itself.
