BinaryIterativeSearch return the index of target within a sorted slice, use binary search (no recursive).

BinarySearch return the index of target within a sorted slice, use binary search (recursive call itself).

BubbleSort applys the bubble sort algorithm to sort the collection, will change the original collection data.

CountSort apply the count sort algorithm to sort the collection, don't change the original collection data.

HeapSort applys the heap sort algorithm to sort the collection, will change the original collection data.

InsertionSort apply the insertion sort algorithm to sort the collection, will change the original collection data.

LinearSearch return the index of target in slice base on equal function.

MergeSort applys the merge sort algorithm to sort the collection, will change the original collection data.

NewLRUCache creates a LRUCache pointer instance.

QuickSort quick sorting for slice, lowIndex is 0 and highIndex is len(slice)-1.

SelectionSort apply the selection sort algorithm to sort the collection, will change the original collection data.

ShellSort applys the shell sort algorithm to sort the collection, will change the original collection data.

LRUCache lru cache (thread unsafe).