Write a pseudocode for an algorithm to find k$$th smallest element in an array and find the time complexity of your algorithm $($Big o notation$)$

Given an integer array, find k$\text{'}$th smallest element in the array where k is a positive integer less than or equal to the length of array.