input an unsorted array A of n number and an integer k with 1= B2....>=[k] index of the array starts from 1 1. write algorothim pseudocode. analyze the bestcase .k . analyze the worse case of k.

input an unsorted array A of n number and an integer k with 1<= k=""><=>

output an array B of size k that contains the k largest numbers in A with B[1] >= B2....>=[k]

index of the array starts from 1

1. write algorothim pseudocode. analyze the bestcase .k . analyze the worse case of k.