Kth SMALLEST ELEMENT

 

Kth Smallest Element in an Array 

Introduction

Finding the kth smallest element in an array is a common problem in programming. It helps in understanding sorting techniques and how elements are ordered.

The kth smallest element means the element that would appear at position k if the array is sorted in ascending order.

Problem Statement

Given an array arr[] and an integer k, return the kth smallest element.

Example

Input:

arr = [10, 5, 4, 3, 48, 6, 2, 33, 53, 10]
k = 4

Output:

5

Explanation:
Sorted array = [2, 3, 4, 5, 6, 10, 10, 33, 48, 53]
4th smallest element is 5

Solution Code

class Solution:
    def kthSmallest(self, arr, k):
        arr.sort()
        return arr[k - 1]

Approach Used: Sorting

Idea

If we sort the array in ascending order, the kth smallest element will be at index k-1 (since indexing starts from 0).

How It Works

  1. Sort the array using arr.sort()

  2. Access the element at index k-1

  3. Return that element

Why This Approach Was Chosen

  • Very simple and easy to implement

  • Built-in sorting is efficient and reliable

  • Reduces complexity of manually finding kth element

Alternative Approaches

  • Using Min Heap / Max Heap
    Useful for large datasets

  • QuickSelect Algorithm (Optimal)
    Time complexity can be reduced to O(n)

Why not used here?
For basic understanding and implementation, sorting is straightforward and sufficient.

Time and Space Complexity

  • Time Complexity: O(n log n) (due to sorting)

  • Space Complexity: O(1) (in-place sort)

Important Observation

  • Since Python uses 0-based indexing, we use k-1

  • Sorting changes the original array (in-place)

Conclusion

Using sorting to find the kth smallest element is a simple and effective approach. While more optimized methods exist, this method is preferred for clarity and ease of implementation, especially for beginners.

Comments

Post a Comment

Popular posts from this blog

THE DELIVERY MAN

  The Delivery Man – Python List Operations  Introduction Lists in Python are used to store multiple items in a single variable. They are flexible, allowing us to add, remove, update, and manipulate elements easily. In this task, different list operations are performed to simulate a delivery man's workflow. 1. Creating a list and accessing an item items = ["Notebook", "Pencil", "Eraser", "Ruler", "Marker"] print(items[2]) Approach: Indexing Why: Lists use zero-based indexing, so the third item is accessed using index 2. 2. Adding a new item items.append("Glue Stick") print(items) Approach: append() method Why: It adds an item at the end of the list, which is ideal for adding new deliveries. 3. Inserting an item items.insert(2, "Highlighter") print(items) Approach: insert() method Why: Used when we need to add an item at a specific position instead of the end. 4. Removing an item items.remove("Ruler...
Read more

EC2 LAUNCHING

  EC2 Step 1: Launch EC2 Instance Go to: AWS Console --> EC2 --> Launch Instance Configure: Name : my-web-server AMI : Amazon Linux 2 (easy for beginners) Instance Type : t2.micro (free tier) Step 2: Key Pair Create or select a key pair. Step 3: Network Settings  Allow these: SSH (port 22) --> for login  HTTP (port 80) --> for web access Step 4: Launch Instance Click Launch Instance Step 5: Connect to Instance Use: EC2 --> Connect --> EC2 Instance Connect (easiest) OR via terminal: with this command. for this you have to download the pem files while selecting the key pair.  ssh -i your-key.pem ec2-user@<public-ip> Step 6: Install Web Server For Amazon Linux: sudo yum update -y sudo yum install httpd -y Step 7: Start Web Server sudo systemctl start httpd sudo systemctl enable httpd Step 8: Add a Web Page echo "Hello from EC2" | sudo tee /var/www/html/index.html Step 9: Get Public IP Go to EC2 d...
Read more

SORT A LINKED LIST USING MERGE SORT

  Sort a Linked List using Merge Sort Introduction Sorting a linked list efficiently is a common problem in data structures. Unlike arrays, linked lists do not allow direct access to elements, so algorithms like quicksort are not ideal. Merge Sort is the best choice for linked lists because: It does not require random access It works efficiently with node-based structures Problem Statement Given the head of a linked list: Sort the list in ascending order Return the sorted linked list Example Input: 10 -> 30 -> 20 -> 40 -> 60 -> 50 Output: 10 -> 20 -> 30 -> 40 -> 50 -> 60 Solution Code class Solution: def mergeSort(self, head): if not head or not head.next: return head mid = self.getMiddle(head) next_to_mid = mid.next mid.next = None left = self.mergeSort(head) right = self.mergeSort(next_to_mid) return self.merge(left, right) def getMiddle(self,...
Read more