We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 7cce60e commit cd08a00Copy full SHA for cd08a00
Sorts/InsertionSort.ts
@@ -4,7 +4,7 @@
4
* @param {number[]} num - The input array
5
* @return {number[]} - The sorted array.
6
* @see [Insertion Sort](https://www.freecodecamp.org/news/sorting-algorithms-explained-with-examples-in-python-java-and-c#insertion-sort)
7
- * @example BinaryConvert([8, 3, 5, 1, 4, 2]) = [1, 2, 3, 4, 5, 8]
+ * @example insertionSort([8, 3, 5, 1, 4, 2]) = [1, 2, 3, 4, 5, 8]
8
*/
9
10
export const insertionSort = (arr: number[]): number[] => {
0 commit comments