Use sup tag for power in README.md instead of ^

README.md

@@ -13,9 +13,9 @@ These are for demonstration purposes only. There are many implementations of sor
 From [Wikipedia][bubble-wiki]: Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted.
 
 __Properties__
-* Worst case performance	O(n^2)
+* Worst case performance	O(n<sup>2</sup>)
 * Best case performance	O(n)
-* Average case performance	O(n^2)
+* Average case performance	O(n<sup>2</sup>)
 
 ###### View the algorithm in [action][bubble-toptal]
 
@@ -26,7 +26,7 @@ __Properties__
 From [Wikipedia][bucket-wiki]: Bucket sort, or bin sort, is a sorting algorithm that works by distributing the elements of an array into a number of buckets. Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorting algorithm.
 
 __Properties__
-* Worst case performance	O(n^2)
+* Worst case performance	O(n<sup>2</sup>)
 * Best case performance	O(n+k)
 * Average case performance	O(n+k)
 
@@ -36,9 +36,9 @@ __Properties__
 From [Wikipedia][cocktail-shaker-wiki]: Cocktail shaker sort, also known as bidirectional bubble sort, cocktail sort, shaker sort (which can also refer to a variant of selection sort), ripple sort, shuffle sort, or shuttle sort, is a variation of bubble sort that is both a stable sorting algorithm and a comparison sort. The algorithm differs from a bubble sort in that it sorts in both directions on each pass through the list.
 
 __Properties__
-* Worst case performance	O(n^2)
+* Worst case performance	O(n<sup>2</sup>)
 * Best case performance	O(n)
-* Average case performance	O(n^2)
+* Average case performance	O(n<sup>2</sup>)
 
 
 ### Insertion
@@ -47,9 +47,9 @@ __Properties__
 From [Wikipedia][insertion-wiki]: Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.
 
 __Properties__
-* Worst case performance	O(n^2)
+* Worst case performance	O(n<sup>2</sup>)
 * Best case performance	O(n)
-* Average case performance	O(n^2)
+* Average case performance	O(n<sup>2</sup>)
 
 ###### View the algorithm in [action][insertion-toptal]
 
@@ -73,7 +73,7 @@ __Properties__
 From [Wikipedia][quick-wiki]: Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order.
 
 __Properties__
-* Worst case performance	O(n^2)
+* Worst case performance	O(n<sup>2</sup>)
 * Best case performance	O(n log n) or O(n) with three-way partition
 * Average case performance	O(n log n)
 
@@ -94,9 +94,9 @@ __Properties__
 From [Wikipedia][selection-wiki]: The algorithm divides the input list into two parts: the sublist of items already sorted, which is built up from left to right at the front (left) of the list, and the sublist of items remaining to be sorted that occupy the rest of the list. Initially, the sorted sublist is empty and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on sorting order) element in the unsorted sublist, exchanging (swapping) it with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right.
 
 __Properties__
-* Worst case performance	O(n^2)
-* Best case performance	O(n^2)
-* Average case performance	O(n^2)
+* Worst case performance	O(n<sup>2</sup>)
+* Best case performance	O(n<sup>2</sup>)
+* Average case performance	O(n<sup>2</sup>)
 
 ###### View the algorithm in [action][selection-toptal]