@promiseokenna
Backend Engineer @ Enyata
Nothing here yet.
Nothing here yet.
Introduction 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...

Introduction 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...

Introduction 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 - ...

Introduction 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 ...
