okenna.hashnode.devALGORITHMS: Introduction to Algorithm AnalysisIntroduction Algorithms are the step-by-step instructions to solve problems or execute specific tasks efficiently. They are the foundation of countless applications, from searching through user data and sorting user data to finding the optimal routes...Feb 8, 2025·9 min read
okenna.hashnode.devALGORITHMS: Implementing Quick Sort Algorithm in JavascriptIntroduction Sorting algorithms are foundational in computer science. Sorting enables efficient data organization and retrieval. Quick sort is known for being efficient and is largely used due to its ability to handle large datasets effectively. Quic...Feb 1, 2025·8 min read
okenna.hashnode.devALGORITHMS: Understanding Divide and Conquer TechniqueIntroduction Divide and conquer is a well-known recursion technique for solving problems. It solves a problem by breaking it into smaller, easier-to-solve problems, solving each problem separately and combining their solutions to address the original...Jan 25, 2025·8 min read
okenna.hashnode.devALGORITHMS: Understanding Recursion And Its RisksIntroduction Imagine John Doe, our building’s maintenance worker, gets a call about a call about a blinking light somewhere in our massive 10-story building. Suppose he does not get the floor number or the room number where this issue is happening - ...Jan 18, 2025·10 min read
okenna.hashnode.devALGORITHMS: Implementing Selection Sort Algorithm In JavaScriptIntroduction Suppose you are organizing a deck of cards, and you want to sort it from the smallest to the largest. Naturally, you might look through the cards, find the smallest one, and place it first. Then you would look for the next smallest, and ...Jan 11, 2025·9 min read
