Find the complexity of the function used to find the kth smallest integer in an unordered array of integers

int select kth {int a [ ], int k, int n} {

int i, j, min i, tmp;

for {i=0; i
mini = i;

for { j= i+1, j< n; j++}

if { a[ j ] < a [min i] }

mini = j;

tmp = a[ i ]

a [ i ] = a[ mini];

a [ mini] = tmp;

}

return a[k-1];

}

find the complexity of the function used to find the kth smallest integer in an unordered array of integers
int select kth {int a [ ], int k, int n} {

int i, j, min i, tmp;

for {i=0; i
mini = i;

for { j= i+1, j< n; j++}

if { a[ j ] < a [min i] }

mini = j;

tmp = a[ i ]

a [ i ] = a[ mini];

a [ mini] = tmp;

}

return a[k-1];

}