Treap: Randomized Binary Search Tree
The treap is a randomized binary search tree that achieves balance through probability rather than rigid structural rules. The name combines ’tree’ and ‘heap’—an apt description since treaps…
Read more →Search
Ternary Search Tree: Space-Efficient Trie Alternative
Standard tries are elegant data structures for string operations. They offer O(L) lookup time where L is the string length, making them ideal for autocomplete, spell checking, and prefix matching….
Read more →Ternary Search: Unimodal Function Search
Binary search finds elements in sorted arrays. Ternary search solves a different problem: finding the maximum or minimum of a unimodal function. While binary search asks ‘is my target to the left or…
Read more →SQLite FTS5: Full-Text Search Extension
FTS5 (Full-Text Search version 5) is a virtual table module that creates inverted indexes for efficient text searching. Unlike regular SQLite tables that store data in B-trees, FTS5 maintains…
Read more →Sentinel Linear Search: Optimized Sequential Search
Linear search is the simplest search algorithm: iterate through elements until you find the target or exhaust the array. Every developer learns it early, and most dismiss it as inefficient compared…
Read more →Python - Regex Match, Search, FindAll
• match() checks patterns only at the string’s beginning, search() finds the first occurrence anywhere, and findall() returns all non-overlapping matches as a list
PostgreSQL Full-Text Search: tsvector and tsquery
Most developers reach for Elasticsearch or Algolia when they need search functionality, but PostgreSQL’s built-in full-text search capabilities are surprisingly powerful. For applications with up to…
Read more →Optimal BST: Minimum Search Cost Tree
Binary search trees give us O(log n) average search time, but that’s only half the story. When you’re building a symbol table for a compiler or a dictionary lookup structure, not all keys are created…
Read more →NumPy - np.searchsorted() - Binary Search
• np.searchsorted() performs binary search on sorted arrays in O(log n) time, returning insertion indices that maintain sorted order—dramatically faster than linear search for large datasets
MySQL Full-Text Search: Natural Language Mode
Natural Language Mode is MySQL’s default full-text search mode, designed to process queries the way users naturally express them. Unlike Boolean Mode, it doesn’t require special operators—users…
Read more →Linear Search: Sequential Search Algorithm
Linear search, also called sequential search, is the most fundamental searching algorithm in computer science. You start at the beginning of a collection and check each element one by one until you…
Read more →K-D Tree: Multidimensional Search Tree
A K-D tree (k-dimensional tree) is a binary space-partitioning data structure designed for organizing points in k-dimensional space. Each node represents a splitting hyperplane that divides the space…
Read more →Jump Search: Block-Based Search Algorithm
Binary search gets all the glory. It’s the algorithm every CS student learns, the one interviewers expect you to write on a whiteboard. But there’s a lesser-known sibling that deserves attention:…
Read more →Interpolation Search: Uniform Distribution Search
Binary search is the go-to algorithm for searching sorted arrays, but it treats all elements as equally likely targets. It always checks the middle element, regardless of the target value. This feels…
Read more →How to Use SEARCH in Excel
The SEARCH function locates text within another text string and returns the position where it first appears. Unlike its cousin FIND, SEARCH is case-insensitive, which makes it ideal for real-world…
Read more →How to Use Full-Text Search in PostgreSQL
PostgreSQL includes robust full-text search capabilities that most developers overlook in favor of external solutions like Elasticsearch. For many applications, PostgreSQL’s search features are…
Read more →How to Perform Random Search in Python
Hyperparameter tuning is the process of finding optimal configuration values that govern your model’s learning process. Unlike model parameters learned during training, hyperparameters must be set…
Read more →How to Perform Grid Search in Python
Hyperparameters are the configuration settings you choose before training begins—learning rate, tree depth, regularization strength. Unlike model parameters (weights and biases learned during…
Read more →How to Perform Grid Search in R
Hyperparameter tuning separates mediocre models from production-ready ones. Unlike model parameters learned during training, hyperparameters are configuration settings you specify before training…
Read more →Fibonacci Search: Division-Based Search
Binary search is the go-to algorithm for searching sorted arrays, but it’s not the only game in town. Fibonacci search offers an alternative approach that replaces division with addition and…
Read more →Exponential Search: Unbounded Search Technique
Binary search is the go-to algorithm for sorted arrays, but it has a fundamental limitation: you need to know the array’s bounds. What happens when you’re searching through a stream of sorted data?…
Read more →DFS: Depth-First Search Algorithm
Depth-First Search is one of the two fundamental graph traversal algorithms every developer should know cold. Unlike its sibling BFS, which explores neighbors level by level, DFS commits fully to a…
Read more →Design a Search Engine: Web Crawling and Indexing
Building a search engine requires clear thinking about what you’re actually building. Let’s define the scope.
Read more →BST Insertion, Deletion, and Search Operations
Binary Search Trees are the workhorse data structure for ordered data. They provide efficient search, insertion, and deletion by maintaining a simple invariant: for any node, all values in its left…
Read more →Binary Search Tree: Implementation and Operations
A binary search tree is a hierarchical data structure where each node contains a value and references to at most two children. The defining property is simple but powerful: for any node, all values…
Read more →Binary Search: Divide and Conquer Search
Binary search is the canonical divide and conquer algorithm. Given a sorted collection, it finds a target value by repeatedly dividing the search space in half. Each comparison eliminates 50% of…
Read more →BFS: Breadth-First Search Algorithm
Breadth-First Search is one of the foundational graph traversal algorithms in computer science. Developed by Konrad Zuse in 1945 and later reinvented by Edward F. Moore in 1959 for finding the…
Read more →B-Tree: Balanced Search Tree for Storage
Every time you query a database, search a file system directory, or look up a key in a production key-value store, you’re almost certainly traversing a B-Tree. This data structure, invented by Rudolf…
Read more →B-Tree: Disk-Optimized Search Tree
Binary search trees are elegant in memory. With O(log₂ n) height, they provide efficient search for in-memory data. But databases don’t live in memory—they live on disk.
Read more →A* Search Algorithm: Heuristic Pathfinding
A* (pronounced ‘A-star’) is the pathfinding algorithm you’ll reach for in 90% of cases. Developed by Peter Hart, Nils Nilsson, and Bertram Raphael at Stanford Research Institute in 1968, it’s become…
Read more →