Question

Language: c++

Write the templated function T kMin(const T* A, const size_t n, const size_t k) that takes as input an array A of values of type T with length n>= 0 and an integer k and returns the k-th smallest value in the array. If k >= n, throw a invalid_argument exception

Example: A = [8,6,7,5,3,0,9] (array of ints), n = 7, k = 2, expected value = 5

Answer 1

#include <iostream>

#include<algorithm>

using namespace std;

template <class T>

void bubble(T *arr, int n)

{

T t = 0;

for(int a=1; a<n; a++)

for(int b=n-1; b>=a; b--)

if(arr[b-1] > arr[b]) {

t = arr[b-1];

arr[b-1] = arr[b];

arr[b] = t;

}

}

template <typename T>

T kMin(T* A, const size_t n, const size_t k) {

bubble(A, n);

return A[k-1];

}

int main() {

int A[] = {8,6,7,5,3,0,9};

cout << kMin(A, 7, 2);

}

#include <iostream> #include<algorithm> using namespace std; clang version 7.0.0-3-ubuntu0.18.04.1 (tags/RELEASE_700/final ? clang++-7 -pthread -o main main.cpp > ./main 3I template <class T> void bubble(T *arr, int n) It = 0; for(int a=1; a<n; a++) for(int b=n-1; b>=a; b--) if(arr[b-1] > arr[b]) { t = arr[b-1); arr[b-1] = arr[b]; arr[b] = t; 17 } 19 20 template <typename T> T kMin(T* A, const size_t n, const size_t k) { bubble (A, n); return A[k-1]; 25 int main() { int A[] = {8,6,7,5,3,0,9}; cout << kMin (A, 7, 2); } 26 27