Returns a List of length n where every element is the given value.
𝒪(𝓃). splitAt n xs returns a tuple where first element is xs prefix of length n and second element is the remainder of the List.
𝒪(𝓃 + 𝓂). Merges two lists according the given ordering.
𝒪(𝓃). Returns a tuple where the first component has the items that satisfy the predicate and the second component has the elements that don't.
𝒪(𝓃). Inserts the given element before every element in the given List.
𝒪(𝓃). Inserts the given element inbetween every two elements in the given List.
𝒪(min(𝓂, 𝓃)). Returns a list containing the results of applying a function to each pair of elements from the input lists.
𝒪(min(𝓂, 𝓃)). Returns a list of pairs formed from the input lists.
𝒪(𝓃 log 𝓃). Sorts a list of elements in ascending order using the MergeSort algorithm.
On average 𝒪(𝓃 log 𝓃), worst case 𝒪(𝓃²). Sorts a list of elements in ascending order using the QuickSort algorithm.
Applies a function to every item on a List and concatenates the result. 𝒪(𝓃), where 𝓃 is the number of items in the resulting list.