Searching and Sorting Algorithms (part 4 of 4)

preview_player
Показать описание
Рекомендации по теме
Комментарии
Автор

Very good coverage of Big-O notation. I especially like the graph showing why each order is better or worse than the others, the explanation of what Big O notation tells us about an algorithm, and also the examples of how to simplify an analysis to Big O notation.

dlwatib
Автор

That tidbit about linear search potentially being quicker than binary search due to caching of neighbouring memory values seems like an excellent interview answer to impress people with!

samhblackmore
Автор

Nice discussion of the trade-offs briant. this helped me a lot.

bertobertoberto
visit shbcf.ru