Загрузка видео...

Не удалось загрузить видео

На главную

Sorting Algorithms Time complexity 🫣

359,228 просмотров • 3 месяцев назад •via X (Twitter)

Комментарии: 14

Фото профиля Matt Dunson
Matt Dunson3 месяцев назад

These sorting algorithms have different speeds, but the video makes them look like they take they dame time to complete. In reality Heap, Merge and Circle would beat the others terribly in most random races and at worst tie.

Фото профиля Norm E.
Norm E.3 месяцев назад

If you scale the timing so they all finish at the same time it ruins the comparison.

Фото профиля Mando Rot 🇮🇳
Mando Rot 🇮🇳3 месяцев назад

Where is random?

Фото профиля luniiya 🧋📎
luniiya 🧋📎3 месяцев назад

WHERE IS BOGO SORT ???

Фото профиля Patryk
Patryk3 месяцев назад

Bogosort better

Фото профиля NavyaCreates
NavyaCreates3 месяцев назад

I am listening it's name for the first time 🤔

Фото профиля Dark Goldenrod
Dark Goldenrod3 месяцев назад

Wow bubble sort with its n^2 complexity is the clear winner, here.

Фото профиля Peter Schmidinger
Peter Schmidinger3 месяцев назад

👎 This animation has absolutely nothing to do with time complexity. It's the opposite. The competition times are synced, the steps / memory movement operations are not counted.

Фото профиля crispywater
crispywater3 месяцев назад

counting sort faster than all this crap

Фото профиля Virendra Patel
Virendra Patel3 месяцев назад

New CAPTCHA

Фото профиля Gooze
Gooze3 месяцев назад

So, is Selection Sort as fast as Merge Sort?... Bullshit!

Фото профиля Yogi for PM 🕉️🇮🇳❤️
Yogi for PM 🕉️🇮🇳❤️3 месяцев назад

Only idiots will agree.

Фото профиля Krzysztof Woś
Krzysztof Woś3 месяцев назад

@hive_echo No count? Could do this linearly for pixels.

Фото профиля Farseen
Farseen3 месяцев назад

new captcha

Похожие видео