diff --git a/public/Sorting_Visualizer/index.html b/public/Sorting_Visualizer/index.html new file mode 100644 index 0000000000..3ca6341052 --- /dev/null +++ b/public/Sorting_Visualizer/index.html @@ -0,0 +1,55 @@ + + +
+ + +Demystifying data structures and algorithms through animation.
+Repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.
O(n²) Time
Builds the final sorted array one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.
O(n²) Time
An efficient, stable sorting algorithm that makes use of the divide and conquer paradigm.
O(n log n) Time
An extremely efficient, unstable algorithm that uses a pivot to partition the array into smaller subarrays.
O(n log n) Time