Question

How to find the Kth smallest number in an unsorted array with C++

Answer 1

#include <iostream>
#include <algorithm> 

int findKthSmallestNumber(int arr[], int size, int k) {
    std::sort(arr, arr + size);
   
    return arr[k - 1];
}

int main() {
    int arr[] = { 42, 90, 21, 30, 37, 81, 45 };
    int k = 3;
    int size = sizeof(arr) / sizeof(arr[0]);
   
    std::cout << findKthSmallestNumber(arr, size, k) << std::endl;
}



/*
run:

37

*/

 

70+ SQL courses for beginners and professionals