insertion sort

[cody-evaluate]

let values = [2, 1, 5, 6, 1, 7, 0]

insertionSort(values, fun(a: AnyStruct, b: AnyStruct): Int {
return (b as! Int) - (a as! Int)
})

[austinkline]

Forgot to assign folks here, thanks for submitting this! I'll take a look this week 🙏

[austinkline]

Let's either delete this file or add .DS_Store to .gitignore

[bluesign]

Suggested change

	while i < array.length {
	arr.append(array[i])
	i = i + 1
	}
	arr.appendAll(array)

[bluesign]

actually I guess: var arr = array also works

[bluesign]

thanks a lot, I made a small comment.

this can be also alternative ( as we are adding items to another array ) :

 pub fun insertionSort(_ array: [AnyStruct], _ f: ((AnyStruct, AnyStruct): Int)): [AnyStruct] {

         var arr: [AnyStruct] = []
         for element in array{
            arr.append(element)
            var j = arr.length - 2
            while j >= 0 && f(arr[j + 1], arr[j]) < 0 {
               arr[j + 1] <-> arr[j]
               j = j - 1
            }
         }
         return arr
}

[bjartek]

status here?