Tag

#searching-algorithms

87 posts24 followers

Explore Hashnode

Alternatives

Bobby StefOct 13 · 7 min read

From a Podcast Archive to a Searchable Sermon Library: Building Skyline Echo

A sermon can stick with you long after Sunday. Finding it again is a different story. You remember a phrase or an idea, but not the episode title. Maybe it was a few weeks ago. Maybe it was last year.

blog.benstef.com

Prithwish NathSep 29 · 16 min read

Stop Relying on AI. Learn The Algorithm First.

A search feature is the easiest thing to screw up because it’s so plug-and-play these days, you barely even think about it. You’ll probably pick a BM25 library (used by Elasticsearch, Lucene, and othe

prithwish-nath.hashnode.dev

AnnetJul 22 · 7 min read

Mastering Searching Algorithms in Python: From Linear Search to Binary Search 🔍

After learning Arrays, the next topic I explored was Searching Algorithms. At first, searching seemed straightforward. But as I started learning Binary Search, I discovered that it's much more than ju

html-portfolio.hashnode.dev

Pranoti PatilFeb 24 · 7 min read

16. A* Algorithm

What is A* Algorithm? “A* (pronounced A-star) is an Informed Search Algorithm used to find the shortest and most efficient path from a start node to a goal node.It is one of the most powerful search a

ai-for-multidisciplinary-application.hashnode.dev

Pranoti PatilFeb 22 · 7 min read

14.8-Puzzle Problem

Introduction The 8-puzzle problem is a classic example in Artificial Intelligence used to demonstrate state-space search and the difference between uninformed and informed search strategies. It consis

ai-for-multidisciplinary-application.hashnode.dev

Pranoti PatilFeb 22 · 3 min read

13.Depth-First Search (DFS)

Definition DFS explores as far down a branch as possible before backtracking.It follows one path deeply until it can’t go further, then goes back and explores other paths. Algorithm (Simple Steps) Pu

ai-for-multidisciplinary-application.hashnode.dev

Pranoti PatilFeb 22 · 4 min read

12.Breadth-First Search (BFS)

BFS uses a Queue to keep track of which nodes to explore next. Definition BFS explores all nodes level by level starting from the root.It visits all nodes at depth 1, then depth 2, and so on. Algorit

ai-for-multidisciplinary-application.hashnode.dev

Pranoti PatilFeb 22 · 2 min read

11.Informed and Uninformed (Blind) Search

So, we saw how an agent (like a driver in Romania) plans its route from Arad to Bucharest.The agent first defines its goal, then looks for the best path using a search process. Now, how do you think t

ai-for-multidisciplinary-application.hashnode.dev

Faisal SayedJan 17 · 5 min read

My MITR Learning Media Interview Experience: How Basics and Balance Helped Me Clear the Interview

Role: Web Developer | Type: On-Campus | Year: B.E This interview stands out as one of the most comfortable and confidence-boosting experiences from my B.E placement phase. It wasn’t just about answering questions. It was about how I communicated, how...

faisal-interview-diaries.hashnode.dev

Sagar KumarDec 6, 2025 · 7 min read