Day 51/150 – Linear Search in Python: Implementation Tutorial
By
Samaksh Dubey
Warm and crisp on the edges. A bagel with a bit of bite.
Summary
A tutorial on implementing Linear Search in Python, covering two methods (for loop and while loop) for searching elements in a list. Part of a 150-day coding challenge series, it explains the basics of linear search as a simple sequential checking technique best suited for small or unsorted datasets.
Key quotes
· 4 pulledLinear Search is one of the simplest searching techniques.
It checks each element in the list one by one until the target value is found.
Best for small or unsorted data
Easy to understand and implement
You might also wanna read
Binary Search in Python: Iterative Implementation Using a While Loop
This article explains the Binary Search algorithm in Python, covering its iterative implementation using a while loop. It highlights that bi
Overview of Maze Generation Algorithms for Programmers
The article presents an overview of various maze generation algorithms used in programming, including Recursive Backtracking, Eller's Algori
Algorithm for Detecting Overlapping Intervals in Programming
This technical blog post explains how to detect overlapping intervals in programming, covering interval representation and the mathematical
Understanding Biconnected Components: Algorithmic Implementation and Applications in Competitive Programming
This article provides an in-depth technical explanation of biconnected components (BCCs) in graph theory, focusing on their importance in co
Counting Paths of Length K in Directed Graphs Using Matrix Exponentiation
This article presents a programming problem about counting paths of length K between two nodes in a directed unweighted graph, where paths c
Building a Minimal RAG System from Scratch: PDF to Highlighted Answers in ~100 Lines of Python
A hands-on tutorial that builds the smallest functional RAG (Retrieval-Augmented Generation) system from scratch using about 100 lines of Py
