# Find kth smallest elements in array

Here given code implementation process.

``````//C Program
//Find kth smallest elements in array
#include <stdio.h>

//Swap two element in array
void swap(int arr[],int first,int second)
{
int temp=arr[first];
arr[first]=arr[second];
arr[second]=temp;
}
//Check the properties of min heap
int compare(int arr[],int left,int right,int root,int size)
{
int location = -1;

if(left < size &&  arr[left] < arr[root] )
{

if(right < size && arr[right] < arr[left])
{

swap(arr,right,root);
location = right;
}
else
{
swap(arr,left,root);
location = left;
}
}
else if(right < size && arr[right] < arr[root])
{
swap(arr,right,root);
location = right;
}
return location;
}
//Perform min heap sort
void heap(int arr[],int size,int root)
{
//Get location of left and right child
int left  = 2*root+1;
int right = 2*root+2;

int next_in = compare(arr, left, right, root, size);

if(next_in != -1)
{
//When array is modified then check other array elements
heap(arr,size,next_in);
}
}
//Display array elements
void print_data(int arr[],int size)
{
printf("\n");
for(int i = 0; i < size; i++)
{
printf("%3d",arr[i] );
}
}

//Finding the kth smallest element in array
void kth_smallest(int arr[],int size,int k)
{

if(k>size || k <=0)
{
//invalid position
return;
}
//Auxiliary memory that will be used to store array elements
int auxiliary[size];

//set initial values into the auxiliary array
for (int i = 0; i < size; ++i)
{
auxiliary[i] = arr[i];
}

for (int i = (size/2)-1; i >= 0; i--)
{
heap(auxiliary,size,i);
}

for (int i = size-1; i >= (size-1 -k); i--)
{
//Swap smallest element at the end
swap(auxiliary, 0, i);
heap(auxiliary, i, 0);
}

printf("\n  %d-th Smallest Element is : ",k);

printf(" %d\n",auxiliary[size-k] );

}
int main()
{
//Define collection of array elements
int arr[] = {6, 8, 2, 7, 14, 32,  1, 3, 9, 21, 11, 12 ,5};

//Get the size of array
int size = sizeof(arr)/sizeof(arr[0]);

//position of find smallest element
int k = 6;

print_data(arr,size);

kth_smallest(arr,size,k);

return 0;
}```
```

#### Output

``````  6  8  2  7 14 32  1  3  9 21 11 12  5
6-th Smallest Element is :  7``````
``````/*
C++ Program
Find kth smallest elements in array
*/
#include<iostream>
using namespace std;

class MyHeap {
public:

//Swap two element in array
void swap(int arr[], int first, int second) {
int temp = arr[first];
arr[first] = arr[second];
arr[second] = temp;
}
//Check the properties of min heap
int compare(int arr[], int left, int right, int root, int size) {
int location = -1;
if (left < size && arr[left] < arr[root]) {
if (right < size && arr[right] < arr[left]) {
this->swap(arr, right, root);
location = right;
} else {
this->swap(arr, left, root);
location = left;
}
} else
if (right < size && arr[right] < arr[root]) {
this->swap(arr, right, root);
location = right;
}
return location;
}
//Perform min heap sort
void heap(int arr[], int size, int root) {
//Get location of left and right child
int left = 2 *root + 1;
int right = 2 *root + 2;
int next_in = this->compare(arr, left, right, root, size);
if (next_in != -1) {
//When array is modified then check other array elements
this->heap(arr, size, next_in);
}
}
//Display array elements
void print_data(int arr[], int size) {
cout << "\n";
for (int i = 0; i < size; i++) {
cout << " " << arr[i];
}
}
//Finding the kth smallest element in array
void kth_smallest(int arr[], int size, int k) {
if (k > size || k <= 0) {
//invalid position

return;
}
int *auxiliary = new int[size];
//set initial values into the auxiliary array

for (int i = 0; i < size; ++i) {
auxiliary[i] = arr[i];
}
for (int i = (size / 2) - 1; i >= 0; i--) {
this->heap(auxiliary, size, i);
}
for (int i = size - 1; i >= (size - 1 - k); i--) {
//Swap smallest element at the end
this->swap(auxiliary, 0, i);
this->heap(auxiliary, i, 0);
}
cout << "\n " << k << "-th Smallest Element is : ";
cout << " " << auxiliary[size - k] << "\n";
}
};
int main() {
MyHeap obj = MyHeap();
int arr[] = {
6,
8,
2,
7,
14,
32,
1,
3,
9,
21,
11,
12,
5
};
//Get the size of array
int size = sizeof(arr) / sizeof(arr[0]);
//position of find smallest element
int k = 6;
obj.print_data(arr, size);
obj.kth_smallest(arr, size, k);
return 0;
}```
```

#### Output

`````` 6 8 2 7 14 32 1 3 9 21 11 12 5
6-th Smallest Element is :  7``````
``````/*
Java Program
Find kth smallest elements in array
*/
public class MyHeap {

//Swap two element in array
public void swap(int []arr,int first,int second)
{
int temp=arr[first];
arr[first]=arr[second];
arr[second]=temp;
}
//Check the properties of min heap
public int compare(int []arr,int left,int right,int root,int size)
{
int location = -1;

if(left < size &&  arr[left] < arr[root] )
{

if(right < size && arr[right] < arr[left])
{

swap(arr,right,root);
location = right;
}
else
{
swap(arr,left,root);
location = left;
}
}
else if(right < size && arr[right] < arr[root])
{
swap(arr,right,root);
location = right;
}
return location;
}
//Perform min heap sort
public void heap(int []arr,int size,int root)
{
//Get location of left and right child
int left  = 2*root+1;
int right = 2*root+2;

int next_in = compare(arr, left, right, root, size);

if(next_in != -1)
{
//When array is modified then check other array elements
heap(arr,size,next_in);
}
}
//Display array elements
void print_data(int []arr,int size)
{
System.out.print("\n");
for(int i = 0; i < size; i++)
{
System.out.print("  "+arr[i] );
}
}

//Finding the kth smallest element in array
void kth_smallest(int []arr,int size,int k)
{

if(k>size || k <=0)
{
//invalid position
return;
}
//Auxiliary memory that will be used to store array elements
int []auxiliary= new int[size];

//set initial values into the auxiliary array
for (int i = 0; i < size; ++i)
{
auxiliary[i] = arr[i];
}

for (int i = (size/2)-1; i >= 0; i--)
{
heap(auxiliary,size,i);
}

for (int i = size-1; i >= (size-1 -k); i--)
{
//Swap smallest element at the end
swap(auxiliary, 0, i);
heap(auxiliary, i, 0);
}

System.out.print("\n "+k+"-th Smallest Element is : ");

System.out.print(" "+auxiliary[size-k]+"\n" );

}
public static void main(String[] args) {

MyHeap obj = new MyHeap();

//Define Collection of array elements
int []arr =  {6, 8, 2, 7, 14, 32,  1, 3, 9, 21, 11, 12 ,5};

//Get the size of array
int size = arr.length;

//position of find smallest element
int k = 6;

obj.print_data(arr,size);

obj.kth_smallest(arr,size,k);
}
}```
```

#### Output

`````` 6 8 2 7 14 32 1 3 9 21 11 12 5
6-th Smallest Element is :  7``````
``````/*
C# Program
Find kth smallest elements in array
*/
using System;

public class MyHeap {
//Swap two element in array
public void swap(int[] arr, int first, int second) {
int temp = arr[first];
arr[first] = arr[second];
arr[second] = temp;
}
//Check the properties of min heap
public int compare(int[] arr, int left, int right, int root, int size) {
int location = -1;
if (left < size && arr[left] < arr[root]) {
if (right < size && arr[right] < arr[left]) {
swap(arr, right, root);
location = right;
} else {
swap(arr, left, root);
location = left;
}
} else
if (right < size && arr[right] < arr[root]) {
swap(arr, right, root);
location = right;
}
return location;
}
//Perform min heap sort
public void heap(int[] arr, int size, int root) {
//Get location of left and right child
int left = 2 * root + 1;
int right = 2 * root + 2;
int next_in = compare(arr, left, right, root, size);
if (next_in != -1) {
heap(arr, size, next_in);
}
}
//Display array elements
void print_data(int[] arr, int size) {
Console.Write("\n");
for (int i = 0; i < size; i++) {
Console.Write(" " + arr[i]);
}
}
//Finding the kth smallest element in array
void kth_smallest(int[] arr, int size, int k) {
if (k > size || k <= 0) {
return;
}
int[]
//Auxiliary memory that will be used to store array elements
auxiliary = new int[size];
//set initial values into the auxiliary array

for (int i = 0; i < size; ++i) {
auxiliary[i] = arr[i];
}
for (int i = (size / 2) - 1; i >= 0; i--) {
heap(auxiliary, size, i);
}
for (int i = size - 1; i >= (size - 1 - k); i--) {
swap(auxiliary, 0, i);
heap(auxiliary, i, 0);
}
Console.Write("\n " + k + "-th Smallest Element is : ");
Console.Write(" " + auxiliary[size - k] + "\n");
}
public static void Main(String[] args) {
MyHeap obj = new MyHeap();
int[]
//Define Collection of array elements
arr = {
6,
8,
2,
7,
14,
32,
1,
3,
9,
21,
11,
12,
5
};
//Get the size of array
int size = arr.Length;
//position of find smallest element
int k = 6;
obj.print_data(arr, size);
obj.kth_smallest(arr, size, k);
}
}```
```

#### Output

`````` 6 8 2 7 14 32 1 3 9 21 11 12 5
6-th Smallest Element is :  7``````
``````<?php
/*
Php Program
Find kth smallest elements in array
*/
class MyHeap {
//Swap two element in array

public 	function swap(&\$arr, \$first, \$second) {
\$temp = \$arr[\$first];
\$arr[\$first] = \$arr[\$second];
\$arr[\$second] = \$temp;
}
//Check the properties of min heap

public 	function compare(&\$arr, \$left, \$right, \$root, \$size) {
\$location = -1;
if (\$left < \$size && \$arr[\$left] < \$arr[\$root]) {
if (\$right < \$size && \$arr[\$right] < \$arr[\$left]) {
\$this->swap(\$arr, \$right, \$root);
\$location = \$right;
} else {
\$this->swap(\$arr, \$left, \$root);
\$location = \$left;
}
} else
if (\$right < \$size && \$arr[\$right] < \$arr[\$root]) {
\$this->swap(\$arr, \$right, \$root);
\$location = \$right;
}
return \$location;
}
//Perform min heap sort

public 	function heap(&\$arr, \$size, \$root) {
//Get location of left and right child
\$left = 2 *\$root + 1;
\$right = 2 *\$root + 2;
\$next_in = \$this->compare(\$arr, \$left, \$right, \$root, \$size);
if (\$next_in != -1) {
//When array is modified then check other array elements
\$this->heap(\$arr, \$size, \$next_in);
}
}
//Display array elements
function print_data(\$arr, \$size) {
echo("\n");
for (\$i = 0; \$i < \$size; \$i++) {
echo(" ". \$arr[\$i]);
}
}
//Finding the kth smallest element in array
function kth_smallest(\$arr, \$size, \$k) {
if (\$k > \$size || \$k <= 0) {
return;
}
//Auxiliary memory that will be used to store array elements
\$auxiliary = array_fill(0, \$size, 0);
//set initial values into the auxiliary array

for (\$i = 0; \$i < \$size; ++\$i) {
\$auxiliary[\$i] = \$arr[\$i];
}
for (\$i = (intval(\$size / 2)) - 1; \$i >= 0; \$i--) {
\$this->heap(\$auxiliary, \$size, \$i);
}
for (\$i = \$size - 1; \$i >= (\$size - 1 - \$k); \$i--) {
//Swap smallest element at the end
\$this->swap(\$auxiliary, 0, \$i);
\$this->heap(\$auxiliary, \$i, 0);
}
echo("\n ". \$k ."-th Smallest Element is : ");
echo(" ". \$auxiliary[\$size - \$k] ."\n");
}
}

function main() {
\$obj = new MyHeap();
//Define Collection of array elements
\$arr = array(6, 8, 2, 7, 14, 32, 1, 3, 9, 21, 11, 12, 5);
//Get the size of array
\$size = count(\$arr);
//position of find smallest element
\$k = 6;
\$obj->print_data(\$arr, \$size);
\$obj->kth_smallest(\$arr, \$size, \$k);

}
main();```
```

#### Output

`````` 6 8 2 7 14 32 1 3 9 21 11 12 5
6-th Smallest Element is :  7``````
``````/*
Node Js Program
Find kth smallest elements in array
*/
class MyHeap {
//Swap two element in array
swap(arr, first, second) {
var temp = arr[first];
arr[first] = arr[second];
arr[second] = temp;
}

//Check the properties of min heap
compare(arr, left, right, root, size) {
var location = -1;
if (left < size && arr[left] < arr[root]) {
if (right < size && arr[right] < arr[left]) {
this.swap(arr, right, root);
location = right;
} else {
this.swap(arr, left, root);
location = left;
}
} else
if (right < size && arr[right] < arr[root]) {
this.swap(arr, right, root);
location = right;
}

return location;
}

//Perform min heap sort
heap(arr, size, root) {
//Get location of left and right child
var left = 2 *root + 1;
var right = 2 *root + 2;
var next_in = this.compare(arr, left, right, root, size);
if (next_in != -1) {
//When array is modified then check other array elements
this.heap(arr, size, next_in);
}
}

//Display array elements
print_data(arr, size) {
process.stdout.write("\n");
for (var i = 0; i < size; i++) {
process.stdout.write(" " + arr[i]);
}
}

//Finding the kth smallest element in array
kth_smallest(arr, size, k) {
if (k > size || k <= 0) {
return;
}

//Auxiliary memory that will be used to store array elements
var auxiliary = Array(size).fill(0);
//set initial values into the auxiliary array

for (var i = 0; i < size; ++i) {
auxiliary[i] = arr[i];
}

for (var i = (parseInt(size / 2)) - 1; i >= 0; i--) {
this.heap(auxiliary, size, i);
}

for (var i = size - 1; i >= (size - 1 - k); i--) {
//Swap smallest element at the end
this.swap(auxiliary, 0, i);
this.heap(auxiliary, i, 0);
}

process.stdout.write("\n " + k + "-th Smallest Element is : ");
process.stdout.write(" " + auxiliary[size - k] + "\n");
}
}

function main(args) {
var obj = new MyHeap();
//Define Collection of array elements
var arr = [6, 8, 2, 7, 14, 32, 1, 3, 9, 21, 11, 12, 5];
//Get the size of array
var size = arr.length;
//position of find smallest element
var k = 6;
obj.print_data(arr, size);
obj.kth_smallest(arr, size, k);
}

main();```
```

#### Output

`````` 6 8 2 7 14 32 1 3 9 21 11 12 5
6-th Smallest Element is :  7``````
``````# Python 3 Program
# Find kth smallest elements in array
class MyHeap :
# Swap two element in array
def swap(self, arr, first, second) :
temp = arr[first]
arr[first] = arr[second]
arr[second] = temp

# Check the properties of min heap
def compare(self, arr, left, right, root, size) :
location = -1
if (left < size and arr[left] < arr[root]) :
if (right < size and arr[right] < arr[left]) :
self.swap(arr, right, root)
location = right
else :
self.swap(arr, left, root)
location = left

elif (right < size and arr[right] < arr[root]) :
self.swap(arr, right, root)
location = right

return location

# Perform min heap sort
def heap(self, arr, size, root) :
left = 2 * root + 1
right = 2 * root + 2
next_in = self.compare(arr, left, right, root, size)
if (next_in != -1) :
self.heap(arr, size, next_in)

def print_data(self, arr, size) :
print("\n", end = "")
i = 0
while (i < size) :
print(" ", arr[i], end = "")
i += 1

def kth_smallest(self, arr, size, k) :
if (k > size or k <= 0) :
return

auxiliary = [0] * size
# set initial values into the auxiliary array
i = 0
while (i < size) :
auxiliary[i] = arr[i]
i += 1

i = (int(size / 2)) - 1
while (i >= 0) :
self.heap(auxiliary, size, i)
i -= 1

i = size - 1
while (i >= (size - 1 - k)) :
self.swap(auxiliary, 0, i)
self.heap(auxiliary, i, 0)
i -= 1

print("\n ", k ,"-th Smallest Element is : ", end = "")
print(" ", auxiliary[size - k] ,"\n", end = "")

def main() :
obj = MyHeap()
arr = [6, 8, 2, 7, 14, 32, 1, 3, 9, 21, 11, 12, 5]
size = len(arr)
k = 6
obj.print_data(arr, size)
obj.kth_smallest(arr, size, k)

if __name__ == "__main__":
main()```
```

#### Output

``````  6  8  2  7  14  32  1  3  9  21  11  12  5
6 -th Smallest Element is :   7``````
``````# Ruby Program
# Find kth smallest elements in array
class MyHeap
# Swap two element in array
def swap(arr, first, second)
temp = arr[first]
arr[first] = arr[second]
arr[second] = temp
end
# Check the properties of min heap
def compare(arr, left, right, root, size)
location = -1
if (left < size && arr[left] < arr[root])
if (right < size && arr[right] < arr[left])
self.swap(arr, right, root)
location = right
else
self.swap(arr, left, root)
location = left
end
elsif (right < size && arr[right] < arr[root])
self.swap(arr, right, root)
location = right
end
return location
end
# Perform min heap sort
def heap(arr, size, root)
left = 2 * root + 1
right = 2 * root + 2
next_in = self.compare(arr, left, right, root, size)
if (next_in != -1)
self.heap(arr, size, next_in)
end
end
def print_data(arr, size)
print("\n")
i = 0
while (i < size)
print(" ", arr[i])
i += 1
end
end
def kth_smallest(arr, size, k)
if (k > size || k <= 0)
return
end
auxiliary = Array.new(size, 0)
# set initial values into the auxiliary array
i = 0
while (i < size)
auxiliary[i] = arr[i]
i += 1
end
i = (size / 2) - 1
while (i >= 0)
self.heap(auxiliary, size, i)
i -= 1
end
i = size - 1
while (i >= (size - 1 - k))
self.swap(auxiliary, 0, i)
self.heap(auxiliary, i, 0)
i -= 1
end
print("\n ", k ,"-th Smallest Element is  :")
print(" ", auxiliary[size - k] ,"\n")
end
end
def main()
obj = MyHeap.new()
arr = [6, 8, 2, 7, 14, 32, 1, 3, 9, 21, 11, 12, 5]
size = arr.length
k = 6
obj.print_data(arr, size)
obj.kth_smallest(arr, size, k)
end
main()```
```

#### Output

`````` 6 8 2 7 14 32 1 3 9 21 11 12 5
6-th Smallest Element is  : 7
``````
``````/*
Scala Program
Find kth smallest elements in array
*/
class MyHeap {
//Swap two element in array
def swap(arr: Array[Int], first: Int, second: Int): Unit = {
val temp: Int = arr(first);
arr(first) = arr(second);
arr(second) = temp;
}
//Check the properties of min heap
def compare(arr: Array[Int], left: Int, right: Int, root: Int, size: Int): Int = {
var location: Int = -1;

if (left < size && arr(left) < arr(root)) {
if (right < size && arr(right) < arr(left)) {
this.swap(arr, right, root);
location = right;
} else {
this.swap(arr, left, root);
location = left;
}
} else
if (right < size && arr(right) < arr(root)) {
this.swap(arr, right, root);
location = right;
}
return location;
}
//Perform min heap sort
def heap(arr: Array[Int], size: Int, root: Int): Unit = {
val left: Int = 2 * root + 1;
val right: Int = 2 * root + 2;
val next_in: Int = this.compare(arr, left, right, root, size);

if (next_in != -1) {
this.heap(arr, size, next_in);
}
}
def print_data(arr: Array[Int], size: Int): Unit = {
print("\n");
var i: Int = 0;
while (i < size) {
print(" " + arr(i));
i += 1;
}
}
def kth_smallest(arr: Array[Int], size: Int, k: Int): Unit = {
if (k > size || k <= 0) {
return;
}
var auxiliary: Array[Int] = Array.fill[Int](size)(0);

//set initial values into the auxiliary array
var i: Int = 0;
while (i < size) {
auxiliary(i) = arr(i);
i += 1;
}
i = ((size / 2).toInt) - 1;
while (i >= 0) {
this.heap(auxiliary, size, i);
i -= 1;
}
i = size - 1;
while (i >= (size - 1 - k)) {
this.swap(auxiliary, 0, i);
this.heap(auxiliary, i, 0);
i -= 1;
}
print("\n " + k + "-th Smallest Element is : ");
print(" " + auxiliary(size - k) + "\n");
}
}
object Main {
def main(args: Array[String]): Unit = {
val obj: MyHeap = new MyHeap();
val arr: Array[Int] = Array(6, 8, 2, 7, 14, 32, 1, 3, 9, 21, 11, 12, 5);
val size: Int = arr.length;
val k: Int = 6;
obj.print_data(arr, size);
obj.kth_smallest(arr, size, k);
}
}```
```

#### Output

`````` 6 8 2 7 14 32 1 3 9 21 11 12 5
6-th Smallest Element is :  7``````
``````/*
Swift Program
Find kth smallest elements in array
*/
class MyHeap {
//Swap two element in array
func swap(_ arr: inout [Int], _ first: Int, _ second: Int) {
let temp = arr[first];
arr[first] = arr[second];
arr[second] = temp;
}
//Check the properties of min heap
func compare(_ arr: inout [Int], _ left: Int, _ right: Int, _ root: Int, _ size: Int) -> Int {
var location = -1;
if (left < size && arr[left] < arr[root]) {
if (right < size && arr[right] < arr[left]) {
self.swap(&arr, right, root);
location = right;
} else {
self.swap(&arr, left, root);
location = left;
}
} else
if (right < size && arr[right] < arr[root]) {
self.swap(&arr, right, root);
location = right;
}
return location;
}
//Perform min heap sort
func heap(_ arr: inout [Int], _ size: Int, _ root: Int) {
let left = 2 * root + 1;
let right = 2 * root + 2;
let next_in = self.compare(&arr, left, right, root, size);
if (next_in != -1) {
self.heap(&arr, size, next_in);
}
}
func print_data(_ arr: [Int], _ size: Int) {
print("\n", terminator: "");
var i = 0;
while (i < size) {
print(" ", arr[i], terminator: "");
i += 1;
}
}
func kth_smallest(_ arr: [Int], _ size: Int, _ k: Int) {
if (k > size || k <= 0) {
return;
}
var auxiliary = Array(repeating: 0, count: size);
//set initial values into the auxiliary array
var i = 0;
while (i < size) {
auxiliary[i] = arr[i];
i += 1;
}
i = (size / 2) - 1;
while (i >= 0) {
self.heap(&auxiliary, size, i);
i -= 1;
}
i = size - 1;
while (i >= (size - 1 - k)) {
self.swap(&auxiliary, 0, i);
self.heap(&auxiliary, i, 0);
i -= 1;
}
print("\n ", k ,"-th Smallest Element is : ", terminator: "");
print(" ", auxiliary[size - k] ,"\n", terminator: "");
}
}
func main() {
let obj = MyHeap();
let arr = [6, 8, 2, 7, 14, 32, 1, 3, 9, 21, 11, 12, 5];
let size = arr.count;
let k = 6;
obj.print_data(arr, size);
obj.kth_smallest(arr, size, k);
}
main();```
```

#### Output

``````  6  8  2  7  14  32  1  3  9  21  11  12  5
6 -th Smallest Element is :   7``````

## Comment

Please share your knowledge to improve code and content standard. Also submit your doubts, and test case. We improve by your feedback. We will try to resolve your query as soon as possible.