正在加载视频...

视频加载失败

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

相关视频