Definition
Smallest value
Return the least element in a list of numbers.
Find Minimum Value of an Array in Python
Overview
What You’ll Learn
Finding the minimum in an unsorted list is a single left-to-right scan: start with arr[0], then update whenever a smaller value appears. This tutorial covers the pattern, empty-list handling, negatives, a live preview, worked Python examples, edge cases, and complexity.
Linear Scan
One pass
Track a running minimum while walking the list.
Init Rule
arr[0] first
Seed min_val with the first element, then compare the rest.
Empty Guard
No min
Reject empty lists before scanning.
Live Preview
Sample → 2
Run the classic sample list in the browser.
O(n) Cost
O(1) space
One pass, constant extra memory — faster than sorting.
Introduction
Finding the minimum in an unsorted list means returning the smallest value. Start with the first element as the current minimum; whenever you see a smaller number, update it.
After one pass, the running minimum is the answer. The same idea works for all-negative lists — the minimum is simply the most negative value.
Why it matters?
It mirrors finding the maximum with one flipped comparison — a classic interview twin pair for loops and empty-input thinking.
Key Highlights
Running Min
Update whenever x < min_val.
Seed With First
Avoid sentinel values that break negatives.
Empty Guard
Raise or validate before indexing.
Beat Sorting
Do not sort when you only need the min.
In short: if the list is non-empty, set min_val = arr[0], then for each later value update when smaller.
Foundation
📝 Problem & Approach
Given a non-empty list of integers, return the smallest value using one linear scan.
python
# [12, 5, 7, 3, 2, 8, 10] -> 2
# min_val starts at 12, then updates to 5, 3, 2Inputs & Outputs
| Item | Type | Description |
|---|---|---|
arr | list[int] | Non-empty list of numbers. |
| Return / print | int / text | The smallest value in the list. |
Minimal workflow
Pseudocode
function find_min(arr):
if arr is empty:
error
min_val <- arr[0]
for each value from second element:
if value < min_val:
min_val <- value
return min_valMethod comparison
| Method | Idea | Notes |
|---|---|---|
| Linear scan | Running minimum | Interview default — O(n), O(1) space |
Built-in min | min(arr) | Fine in apps; show loops in interviews |
| Sort then take first | Sort ascending | Slower — avoid when only min is needed |
Cheat Sheet
⚡ Quick Reference
| Goal | Pattern |
|---|---|
| Seed | min_val = arr[0] |
| Update | if arr[i] < min_val: min_val = arr[i] |
| Empty guard | if not arr: raise ValueError(...) |
| Slice loop | for x in arr[1:]: |
| Track index | Keep min_i when updating |
| Built-in | min(arr) (after explaining the scan) |
Compare
📋 Scan vs min() vs Sort
Same answer — different costs and interview signals.
Linear scan
running minThis page — clear O(n) interview style
Built-in
min(arr)Production shortcut after you can explain it
Sort
sorted(arr)[0]Overkill — usually O(n log n)
Interview tip
mention emptyDefine behavior for [] up front
Context
When This Problem Shows Up
Reach for a running minimum whenever you need the smallest value in one pass.
Interview warm-ups
Loops, comparisons, and empty-list discussion.
After maximum
Same pattern; only the comparison flips.
Floors and lows
Lowest score, coldest reading, cheapest price.
Teaching comparisons
Practice less-than updates and negatives.
Not for sorting needs
If you need order of all elements, sort instead.
Key benefit: one short loop that locks in running state, empty guards, and O(n) reasoning — the twin of array maximum.
Interactive
🔮 Live Preview
Uses the same sample list as Example 1: 12, 5, 7, 3, 2, 8, 10.
Hands-On
Examples Gallery
Three complete Python programs — classic scan to 2, all-negative list, and min-with-index tracking. Click View Output to reveal sample console results.
📚 Getting Started
A reusable helper and a mixed positive sample.
Example 1 — Find Minimum (Reference Program)
Same sample values as the reference flow; output is 2.
python
def find_min(arr: list[int]) -> int:
if not arr:
raise ValueError("Array must contain at least one element.")
min_val = arr[0]
for i in range(1, len(arr)):
if arr[i] < min_val:
min_val = arr[i]
return min_val
def main() -> None:
array = [12, 5, 7, 3, 2, 8, 10]
min_value = find_min(array)
print(f"Minimum value in the array: {min_value}")
if __name__ == "__main__":
main()How It Works
The function raises a clear error for empty input and uses one simple pass for normal lists. Running min starts at 12, then updates to 5, 3, and finally 2.
⚡ Negatives Still Work
The minimum is the smallest value — even when every element is negative.
Example 2 — When Every Element Is Negative
Smallest means most negative, so the answer is -9 here.
python
def find_min(arr: list[int]) -> int:
if not arr:
raise ValueError("Array must contain at least one element.")
min_val = arr[0]
for x in arr[1:]:
if x < min_val:
min_val = x
return min_val
def main() -> None:
negatives = [-9, -3, -1, -7]
print(f"Minimum (most negative): {find_min(negatives)}")
if __name__ == "__main__":
main()How It Works
Seeding with arr[0] (not a huge positive sentinel) keeps the logic simple. Here -9 is smaller than -7, -3, and -1.
⚙️ Track Position Too
Common follow-up: return both the minimum and its first index.
Example 3 — Minimum With Index
Updates both value and index whenever a strictly smaller element appears.
python
def find_min_with_index(arr: list[int]) -> tuple[int, int]:
if not arr:
raise ValueError("Array must contain at least one element.")
min_val = arr[0]
min_i = 0
for i in range(1, len(arr)):
if arr[i] < min_val:
min_val = arr[i]
min_i = i
return min_val, min_i
array = [12, 5, 7, 3, 2, 8, 10]
value, index = find_min_with_index(array)
print(f"Minimum {value} found at index {index}")How It Works
Strict < keeps the first occurrence if duplicates exist. Use <= only if you intentionally want the last index of the minimum.
🧠 How the Algorithm Finds the Min
1
Guard empty
If the list is empty, raise an error — no minimum exists.
Safety
2
Seed min_val
Set min_val = arr[0] as the first candidate.
Init
3
Scan and update
For each later element, replace min_val when smaller.
Loop
=
Minimum ready
Return the final running minimum.
Trace
🔎 Worked Walkthrough — Sample List
Trace the running minimum for [12, 5, 7, 3, 2, 8, 10].
| Step | See | min_val |
|---|---|---|
| Start | 12 | 12 |
| Next | 5 | 5 |
| Next | 7 | 5 (unchanged) |
| Next | 3 | 3 |
| Next | 2 | 2 |
| Next | 8, 10 | 2 (unchanged) |
Final answer: 2 — matching Example 1.
Use Cases
Where finding a list minimum shows up beyond the interview prompt.
1. Interview Warm-Ups
One-pass loops and empty-list talk.
Example: write find_min(arr).
2. After Maximum
Same scan; flip > to <.
Example: twin of find_max.
3. Floors & Lows
Lowest score or coldest reading in a series.
Example: min temperature today.
4. Negatives Practice
Show most-negative is the minimum.
Example: min of [-9, -1].
5. Complexity Talk
State O(n) vs sorting for interviews.
Example: one pass is enough.
6. Index Follow-Ups
Return position of the minimum too.
Example: Example 3 pattern.
Pro Tip: open with “empty check, seed arr[0], one pass with <” before writing code.
Advantages
Why the linear-scan approach works well in interviews.
1. Optimal Simple Cost
O(n) time and O(1) extra space for unsorted input.
2. Easy to Trace
Dry-run a short list and watch min_val update.
3. Handles Negatives
Seeding with arr[0] works for all-negative lists.
4. Easy to Extend
Track index, or flip to maximum with one change.
Pro Tip: lead with the manual scan; mention min(arr) only as a production aside.
Usage Tips
Small habits that keep min-finding solutions interview-ready.
1. Guard Empty First
Raise before reading
arr[0].2. Seed With arr[0]
Do not initialize to a huge constant blindly.
3. Prefer Strict <
Keeps the first index if you also track position.
4. Skip Sorting
Sorting is slower when you only need the min.
5. State O(n) / O(1)
One pass, constant extra memory.
Pro Tip: dry-run 12 → 5 → 3 → 2 aloud — if that matches, your update logic is correct.
Common Pitfalls
Mistakes that commonly break min-finding solutions.
1. Empty List Crash
Reading
arr[0]when the list is empty.→ Guard with
if not arrfirst.2. Wrong Comparison
Copying max code but forgetting to flip > to <.
→ Minimum uses less-than updates.
3. Sorting Unnecessarily
Sorting just to take the first element.
→ Use one O(n) scan.
4. Off-by-One Loop
Starting the loop at 0 incorrectly.
→ Loop from index 1 (or use
arr[1:]).5. Confusing With Maximum
Returning the least negative when asked for maximum.
→ Clarify: min is farthest left on the number line.
Edge Cases
Handle these before claiming the scan is complete.
Empty
Empty list
There is no minimum; validate before reading first element.
Single
One element
The minimum is that one value.
Negatives
All negative
Minimum is the most negative value (e.g. -9).
Dupes
Repeated minimum
Value is unchanged; index depends on < vs <=.
Mixed
Positives and negatives
Same scan — no special case needed.
Floats
Non-integers
Same comparison logic works for floats.
Theory
⚖️ Facts Worth Knowing
Handy follow-ups interviewers sometimes ask.
- Lower bound. Unsorted min needs at least n-1 comparisons in the worst case.
- Idempotent on dups. Multiple copies of the min do not change the returned value.
- Symmetric twin. Maximum uses the same pass with > instead of <.
- Online-friendly. You can update the min as new values arrive without storing all of them.
Drill
🎯 Practice Problems
Try these variations to lock in the pattern.
1. Dry-run the sample
- Trace [12, 5, 7, 3, 2, 8, 10]
- Expect final min 2
2. All negatives
- Reproduce Example 2
- Confirm answer -9
3. Empty guard
- Call find_min([])
- Assert ValueError (or your chosen policy)
4. Min with index
- Implement Example 3
- Decide first vs last on ties
Important
Notes
- Algorithm: running minimum in one pass.
- Cost:
O(n)time andO(1)extra space. - Important: define behavior for empty input.
- Python has
min(arr), but manual scan is often required in interviews. Large systems can combine partial minima in parallel.
Quick Takeaway: guard empty, seed with arr[0], update on <, return in O(n) time.
Analysis
⏱️ Time and Space Complexity
| Approach | Time | Extra space |
|---|---|---|
| Single scan | O(n) | O(1) |
Built-in min | O(n) | O(1) |
| Sort then take first | O(n log n) | depends on sort |
For unsorted input, a single scan is the standard interview answer.
🎉 Conclusion
Finding the minimum is a one-pass running minimum: guard empty lists, seed with arr[0], and update on smaller values. The same pattern works for negatives and extends cleanly to tracking the index.
Practice the three examples above, then continue to displaying a multiplication table.
Empty check first, then min_val = arr[0], update when x < min_val.
Pro Tips
💡 Best Practices
✅ Do
- Guard empty lists first
- Seed with
arr[0] - Use one O(n) scan
- Mention negatives and duplicates
- State O(n) time / O(1) space
❌ Don’t
- Index empty lists
- Use > when you meant <
- Sort just to find the min
- Skip the empty-list discussion
- Forget that -9 < -1
Summary
Key Takeaways
Knowledge Unlocked
Five things to remember about array minimum
Find the smallest value the interview-friendly way.
5
Core concepts 01
Scan
Running min
Pattern 02
Seed
Start at arr[0]
Init 03
Empty
Guard first
Safety 04
Negatives
Most negative wins
Edge 05
Cost
O(n) / O(1)
Analysis❓ Frequently Asked Questions
It is the smallest value in the list. On the number line, it is the value farthest to the left.
You need an initial candidate from real data. Then each next value can replace it only if smaller.
There is no minimum for an empty list. Validate first and handle this case explicitly.
Yes. For example, in [-9, -3, -1], the minimum is -9.
The algorithm still returns that minimum value correctly; duplicates do not change the answer.
No. One scan is enough and usually faster than sorting when you only need the minimum.
You scan n elements once: O(n) time and O(1) extra space.
It is fine in real code. Interviews often ask you to write the manual linear scan first so you show the comparison logic.
Same one-pass pattern; only the comparison flips from less-than to greater-than.
Did you Know? 🔊
Finding the smallest value in an unsorted list takes a single left-to-right pass: O(n) time and O(1) extra memory. In the worst case, any unseen element could still be the new minimum.
Continue to Multiplication Table
Learn how to use nested loops to display a multiplication table in Python.
About the author
8 people found this page helpful