Contact
CoCalc Logo Icon
StoreFeaturesDocsShareSupport News AboutSign UpSign In
| Download

EX11

Project: LISTA-1
Views: 27
Kernel: SageMath (stable)
def kShortest(arr, k): # builtin sort uses Timsort, which is a sorting algorithm derived from merge sort # best case : O(n) # average case : O(nlogn) # worst case : O(nlogn) arr.sort() return arr[:k]
arr = [1,7,6,3,9,5] k = 3 kShortest(arr, k)
[1, 3, 5]