Find Minimum in Rotated Sorted Array

Animated walkthrough

Step through the algorithm visually — use Play or the step buttons (inspired by AlgoMaster / visualgo).

Step 1 / 1

Apple interview context: Find Minimum in Rotated Sorted Array is a Medium Binary Search problem — Binary search on index or on the answer (binary search on value).

Use the animation above to step through each move before writing code.

Pattern: Binary Search

Read from stdin, write to stdout. Classic interview problem #153.

Problem

Find Minimum in Rotated Sorted Array — Apple interview prep · Binary Search

Classic interview problem #153.

Input (stdin)

Line 1: rotated sorted array (no duplicates)

Output (stdout)

Minimum element

Your program must read from stdin and write the answer to stdout (no extra debug text).

Examples

Sample

Input

3 4 5 1 2

Output

Hints

Input format: Line 1: rotated sorted array (no duplicates)
DSA Interview 150 — Binary Search
Problem #153
Frequently asked at Apple
Binary Search

Your solution

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

class Program
{
    static int[] Ria(string line = null)
    {
        line ??= Console.ReadLine();
        if (string.IsNullOrWhiteSpace(line)) return Array.Empty<int>();
        return line.Trim().Split(new[] { ' ', ',', '\t' }, StringSplitOptions.RemoveEmptyEntries)
            .Select(int.Parse).ToArray();
    }
    static string[] Rsa()
    {
        int n = int.Parse(Console.ReadLine());
        var arr = new string[n];
        for (int i = 0; i < n; i++) arr[i] = Console.ReadLine();
        return arr;
    }
    static void W(params object[] parts) => Console.WriteLine(string.Join(" ", parts));
    static void Wb(bool v) => Console.WriteLine(v ? "true" : "false");
    static void Wi(int v) => Console.WriteLine(v);
    static void Ws(string v) => Console.WriteLine(v);

static void Main()
    {
        // Read from stdin (see problem statement for format)
        // Line 1: rotated sorted array (no duplicates)

}
}

Ready — edit the code above and click Run or Submit.

Solution

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

class Program
{
    static int[] Ria(string line = null)
    {
        line ??= Console.ReadLine();
        if (string.IsNullOrWhiteSpace(line)) return Array.Empty<int>();
        return line.Trim().Split(new[] { ' ', ',', '\t' }, StringSplitOptions.RemoveEmptyEntries)
            .Select(int.Parse).ToArray();
    }
    static string[] Rsa()
    {
        int n = int.Parse(Console.ReadLine());
        var arr = new string[n];
        for (int i = 0; i < n; i++) arr[i] = Console.ReadLine();
        return arr;
    }
    static void W(params object[] parts) => Console.WriteLine(string.Join(" ", parts));
    static void Wb(bool v) => Console.WriteLine(v ? "true" : "false");
    static void Wi(int v) => Console.WriteLine(v);
    static void Ws(string v) => Console.WriteLine(v);

    static void Main()
    {
var nums = Ria();
int lo = 0, hi = nums.Length - 1;
while (lo < hi) {
    int mid = lo + (hi - lo) / 2;
    if (nums[mid] > nums[hi]) lo = mid + 1; else hi = mid;
}
Wi(nums[lo]);
    }
}

Try solving on your own first, then reveal the official answer.

Animated walkthrough

Problem

Examples

Your solution

Solution

Discussion