15 Sorting Algorithms in 6 Minutes

Visualization and “audibilization” of 15 Sorting Algorithms in 6 Minutes.
Sorts random shuffles of integers, with both speed and the number of items adapted to each algorithm’s complexity.
The algorithms are: selection sort, insertion sort, quick sort, merge sort, heap sort, radix sort (LSD), radix sort (MSD), std::sort (intro sort), std::stable_sort (adaptive merge sort), shell sort, bubble sort, cocktail shaker sort, gnome sort, bitonic sort and bogo sort (30 seconds of it).


[vc_video link=’′]


Subscribe to my channel


Getting Started in Project Management – 1. An Introduction

About Rita Mulcahy, PMP
– An expert in advanced project management, the PMP® Exam and risk management
– A gifted instructor and author of the books PMP® Exam Prep and Risk Management Tricks of the Trade
– Founder of RMC Project Management, the Innovators in Project Management Training and Products since 1991.

[vc_video link=’’] Subscribe to my channel


Asch Conformity Experiment

I am forced to put aomething here! It won’t let me upload if I don’t. So that is another way of getting conformity, through force!


[vc_video link=’’]

Subscribe to my channel