Data-Structures-and-Algorithms/DATA STRUCTURES/Array/Kth Smallest Element at master · shoaibrayeen/Data-Structures-and-Algorithms · GitHub

Name		Name	Last commit message	Last commit date
parent directory ..
code_1.cpp		code_1.cpp
code_2.cpp		code_2.cpp
code_3.cpp		code_3.cpp
code_4.cpp		code_4.cpp
code_5.cpp		code_5.cpp
code_6.cpp		code_6.cpp
readMe.md		readMe.md

readMe.md

Given an array and a number k where k is smaller than size of array, we need to find the k’th smallest element in the given array. It is given that ll array elements are distinct.

Input: arr[] = {7, 10, 4, 3, 20, 15}
       k = 3
Output: 7

Input: arr[] = {7, 10, 4, 3, 20, 15}
       k = 4
Output: 10