Kth Smallest Element - CA07

My Thinking and Approach Introduction In this problem, I was given an array of integers and asked to find the kth smallest element in the array. The kth smallest element is based on the sorted order of the array. Problem Statement Given an array of integers arr Given an integer k Find the kth smallest element Note: The kth smallest is based on sorted order My Initial Thought At first, I considered: Sorting the array Returning the element at index k - 1 This approach is simple and works correctly. Key Observation Sorting gives the correct answer: After sorting: 1st smallest → index 0 kth smallest → index k - 1 Optimized Approach I decided to: Sort the array Return the element at index k - 1 Logic: Sort the array in ascending order Return arr[k - 1] My Approach (Step-by-Step) Sort the array Find the element at index k - 1 Return that element Code (Python) def kthSmallest ( arr , k ): arr . sort () return arr [ k - 1 ] Example Walkthrough Input: arr = [10, 5, 4, 3, 48, 6, 2, 33, 53, 10],