In this lecture, we will address one of the commonly tested algorithm problems in Java, which is the “Finding the Kth Smallest Number in an Array” problem. This problem involves finding the Kth smallest number in a given array and can be approached in various ways. The ability to solve such types of problems is crucial for employment coding tests, so let\u2019s aim to upgrade our coding skills through this.<\/p>\n
\nWrite a function that finds and returns the Kth smallest number from the given array.\n\nInput:\n- Integer array arr: an array of size n (1 \u2264 n \u2264 1000)\n- Integer K: K is a value between 1 and n inclusive\n\nOutput:\n- Return the Kth smallest number from the array\n<\/pre>\nExample<\/h2>\n
\nFor example, if \narr = [7, 10, 4, 3, 20, 15] and K = 3, \nthe answer is 7.\n<\/pre>\nApproach<\/h2>\n
To solve this problem, several methods can be considered. The most basic approach is as follows.<\/p>\n
\n
- Method Using Sorting<\/strong>: Sort the array and return the value at the K-1 index.<\/li>\n
- Selection Algorithm (Quickselect)<\/strong>: Use the Quickselect algorithm to directly find the Kth number.<\/li>\n
- Method Using Heap<\/strong>: Use a min-heap to find the Kth smallest value.<\/li>\n<\/ul>\n
Method 1: Method Using Sorting<\/h3>\n
The most intuitive method is to sort the array and return the value at the K-1 index. Using one of the sorting algorithms, the time complexity is O(n log n).<\/p>\n
public class KthSmallestNumber {\n public static int findKthSmallest(int[] arr, int K) {\n Arrays.sort(arr);\n return arr[K - 1];\n }\n \n public static void main(String[] args) {\n int[] arr = {7, 10, 4, 3, 20, 15};\n int K = 3;\n System.out.println(\"Kth smallest number: \" + findKthSmallest(arr, K)); \/\/ 7\n }\n}\n<\/code><\/pre>\nMethod 2: Quickselect Algorithm<\/h3>\n
The Quickselect algorithm is a method to quickly find the Kth smallest element through a process similar to quicksort. This algorithm has an average performance of O(n).<\/p>\n
Quickselect chooses a pivot and partitions the array into smaller and larger values based on the pivot. It then recursively searches in the section where the Kth number should be located.<\/p>\n
public class KthSmallestNumber {\n public static int partition(int[] arr, int left, int right, int pivotIndex) {\n int pivotValue = arr[pivotIndex];\n swap(arr, pivotIndex, right); \/\/ Move the pivot to the end of the array\n int storeIndex = left;\n\n for (int i = left; i < right; i++) {\n if (arr[i] < pivotValue) {\n swap(arr, storeIndex, i);\n storeIndex++;\n }\n }\n swap(arr, storeIndex, right); \/\/ Move the pivot to its final place\n return storeIndex; \/\/ Return the final index of the pivot\n }\n\n public static void swap(int[] arr, int a, int b) {\n int temp = arr[a];\n arr[a] = arr[b];\n arr[b] = temp;\n }\n\n public static int quickSelect(int[] arr, int left, int right, int K) {\n if (left == right) {\n return arr[left]; \/\/ Only one element left\n }\n \n int pivotIndex = left + (right - left) \/ 2; \n pivotIndex = partition(arr, left, right, pivotIndex);\n \n if (K == pivotIndex) {\n return arr[K];\n } else if (K < pivotIndex) {\n return quickSelect(arr, left, pivotIndex - 1, K);\n } else {\n return quickSelect(arr, pivotIndex + 1, right, K);\n }\n }\n\n public static int findKthSmallest(int[] arr, int K) {\n return quickSelect(arr, 0, arr.length - 1, K - 1);\n }\n\n public static void main(String[] args) {\n int[] arr = {7, 10, 4, 3, 20, 15};\n int K = 3;\n System.out.println(\"Kth smallest number: \" + findKthSmallest(arr, K)); \/\/ 7\n }\n}\n<\/code><\/pre>\nMethod 3: Method Using Min-Heap<\/h3>\n
A min-heap has the characteristic that the smallest value is always at the root. When the size of the given array is n, we can extract the smallest K elements using a min-heap to find the Kth element. This method has a performance of O(n + k log n).<\/p>\n
import java.util.PriorityQueue;\n\npublic class KthSmallestNumber {\n public static int findKthSmallest(int[] arr, int K) {\n PriorityQueueminHeap = new PriorityQueue<>();\n \n for (int num : arr) {\n minHeap.offer(num);\n }\n \n int kthSmallest = -1;\n for (int i = 0; i < K; i++) {\n kthSmallest = minHeap.poll();\n }\n \n return kthSmallest;\n }\n\n public static void main(String[] args) {\n int[] arr = {7, 10, 4, 3, 20, 15};\n int K = 3;\n System.out.println(\"Kth smallest number: \" + findKthSmallest(arr, K)); \/\/ 7\n }\n}\n<\/integer><\/code><\/pre>\n Conclusion<\/h2>\n
In this lecture, we explored various algorithmic approaches to the problem of “Finding the Kth Smallest Number in an Array.” We introduced three methods: a simple method using sorting, an efficient method using the Quickselect algorithm, and a method using a min-heap. To cultivate algorithmic problem-solving skills, it is important to experience a variety of problems and understand in which situations each method performs optimally.<\/p>\n
By regularly practicing such problems and building your problem-solving patterns and strategies, you can achieve good results in coding tests.<\/p>\n
I hope that through more lectures covering algorithm problems and their solutions, your coding skills will advance even further.<\/p>\n","protected":false},"excerpt":{"rendered":"