Given an array arr[] and a number K where K is smaller than size of array, the task is to find the Kth smallest element in the given array. It is given that all array elements are distinct.
Kavs-123/Kth-Element
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|