-
From RAG to RAFT: My Journey to a Smarter Reasoning LLM
When I first experimented with Retrieval-Augmented Generation (RAG), it felt like giving a language model access to the internet – suddenly it could pull facts, names, and numbers from external data instead of hallucinating them. It was fast, accurate (most of the time), and deeply satisfying to watch.But then came the tricky questions – the…
-
Choosing the Right Tool: Comparing Basic Search and Sort Algorithms
Algorithms are like tools in a toolbox—each one has a job it does best. Whether you’re searching for a value in a list or sorting a dataset, picking the right algorithm saves time and resources. In our blog series, we’ve explored key searching algorithms (Linear Search, Binary Search, Interpolation Search, Brute-Force String Search) and sorting…
-
Brute-Force String Search: The Straightforward Way to Find Text
Searching for a specific word or phrase in a text is a common task, like finding a friend’s name in a long email thread. Brute-Force String Search is one of the simplest algorithms for this job. It checks every possible position in the text to see if the pattern appears there, making no assumptions and…
-
Interpolation Search: The Smart Search for Sorted Data
Searching through data is like finding a needle in a haystack, but what if the haystack is neatly organized? Interpolation Search is a brilliant algorithm that takes advantage of sorted data to make smarter guesses about where a target value might be. Unlike Binary Search, which always splits the search space in half, Interpolation Search…
-
Quick Sort: The Speedy Divide-and-Conquer Sorting Star
Sorting is like tidying up your desk—everything needs to find its rightful place. Quick Sort is one of the fastest and most popular sorting algorithms, thanks to its clever “divide and conquer” strategy. It picks a special element called a pivot, organizes the rest of the list around it, and recursively sorts the resulting pieces….
-
Merge Sort: The Art of Divide and Conquer Sorting
Sorting is a fundamental task in computer science, whether it’s organizing a list of names, numbers, or even your music playlist. Merge Sort is one of the most elegant and reliable sorting algorithms, known for its consistent performance. It’s a divide and conquer algorithm, meaning it breaks a big problem into smaller, manageable pieces, solves…
All Categories
- AI (3)
- AWS (2)
- Data (1)
- Data Structure and Algorithm (11)
- Design Pattern (7)
- Python (3)
- Web (0)
All Tags
AI (1) ai agent (1) Algorithm Complexity (1) Athena (1) automation (1) AWS (2) BigO (1) Binary Search (1) Brute-Force String Search (1) Bubble Sort (1) Builder Design Pattern (1) Caching (1) Data Structure and Algorithm (11) Dependency Injection (1) Design Pattern (7) DI (1) Factory Design Pattern (1) Fine-Tuning (1) Glue (1) Insertion Sort (1) Interpolation Search (1) Linear Search Algorithm (1) LLM (1) mcp (2) Merge Sort (1) n8n (1) Observer Design Pattern (1) Python (4) Quick Sort (1) RAFT (1) RAG (1) Repository Design Pattern (1) Search Algorithm (1) Selection Sort (1) Singleton Design Pattern (1) Sort Algorithm (1) Spark (1) SQL (1)
My Personal Knowledge Archive
This blog serves as my personal knowledge archive, where I store articles that I find interesting or generate content on topics I want to explore. The posts here are either AI-generated based on subjects I’m curious about or articles I’ve come across and wish to save for future reference. Since the content hasn’t been fully verified, this blog is not intended to be an authoritative source but rather a space for personal learning and storage.