sorted array

Articles about sorted array

1. Article · Java

   Find the Kth Missing Positive Number Using Binary Search

   This article explains how to efficiently find the kth missing positive number in a sorted array. Using the insight that the number of missing numbers before an index i is arr[i] - (i+1), the problem can be solved with binary search, reducing time complexity from O(n + k) to O(log n). The article includes step-by-step examples and a clear Java implementation.

   Sandhiya PriyaJun 113931,000
2. Article · Data Structures and Algorithms (DSA)

   Single Element in a Sorted Array Using Binary Search

   Master binary search to find the single, unpaired element in a sorted array! Learn the logic, code, and common mistakes to ace your coding interviews. O(log n) efficiency.

   Nidhi SharmaJan 231,6921,000
3. Article · Data Structures and Algorithms (DSA)

   Count Occurrences of an Element in a Sorted Array (Using Binary Search)

   Master counting element occurrences in sorted arrays efficiently using Binary Search! This guide provides a step-by-step approach, code examples, and avoids common mistakes. Ace your coding interviews!

   Nidhi SharmaJan 213,6841,000
4. Article · Data Structures and Algorithms (DSA)

   First and Last Occurrence of an Element Using Binary Search

   Master binary search! Efficiently find the first and last positions of an element in a sorted array. Ace coding interviews with this essential algorithm. O(log n) speed!

   Nidhi SharmaJan 213,8661,000
5. Article · Data Structures and Algorithms (DSA)

   Find the Last Occurrence of an Element in a Sorted Array

   Master the art of efficiently locating the last occurrence of an element within a sorted array! This guide explores both brute-force and optimized binary search approaches, providing a C++ implementation and a detailed dry run. Learn how to modify binary search to pinpoint the last instance of a target value, even with duplicates, achieving O(log n) time complexity. Perfect for algorithm enthusiasts and coding interview prep!

   ATAvnii ThakurOct 9, 20253,1181,000
6. 
   Article · Algorithms in C#

   🔍 How to Find the First Occurrence of an Element in a Sorted Array

   This article provides a step-by-step approach, complete with a C code implementation, example dry run, and complexity analysis. Optimize your DSA skills and ace those coding interviews by understanding this essential technique. Learn how to adapt binary search for finding the leftmost instance, ensuring optimal performance in O(log n) time.

   ATAvnii ThakurOct 9, 20251,8971,000
7. Article · Python

   How to Find the Median of a Sorted Array in Python

   Learn how to calculate the median of a pre-sorted Python list in O(1) time, including odd, even, empty, and salary-data examples.

   Tuhin PaulOct 3, 20251,0231,000
8. Article · Java

   Interpolation Search Algorithm in Java

   Learn how Interpolation Search improves upon Binary Search for uniformly distributed, sorted arrays. Explore its working, code examples in Java, performance, use cases, and comparison with Binary Search. 2/2

   Lokendra SinghJun 3, 2025
9. Article · Python

   Two Pointer Approach in Python

   The Two Pointer Approach is one of the most used and efficient techniques to search for a pair in a sorted array. We'll look into the working of it, implementation and use cases.

   Sachin SinghFeb 1, 20243,0971,000
10. Article · Visual Basic 2010

    How Count Sort works in VB.NET

    Count Sort is Linear Sorting algorithm which sorts elements in O(n) time , the other linear sorts include Bucket and Radix sorts.

    RRRazi RaisMar 13, 200627,3601,000