Data Structure and Algorithm

Reference: Key Concept: Suppose, we have two algorithms A and B, then how do we decide which algorithm is better? Upper Bound – Big Oh What is upper bound for a function f(n)? The formal definition can be Formal Definition: Big O Notation For a function \( f(n) \) that is non-negative for all integers ... Read More

Complexity Hierarchy Logarithmic: $O(\log n)$ The “Sublinear” breakthrough. Allows processing of massive matrices by only sampling specific parts. Linear: $O(n)$ The “Old” Standard. Required reading the entire input, which is impossible for modern recommendation scales. Polynomial: $O(poly(k))$ The “Classical Analogue.” While slower than quantum, it remains fast enough to be practical. Exponential: $O(2^n)$ The “Quantum ... Read More

Resources: What is Algorithm? Asymptotic Notation In computer science, Asymptotic Notation is a mathematical language used to describe the efficiency of an algorithm as the input size (usually called $n$) grows toward infinity. It allows us to ignore hardware-specific details (like processor speed) and focus purely on how the time or space requirements of a ... Read More

Resources: Queues are one of the most intuitive and widely used data structures in computer science. If you’ve ever waited in line at a coffee shop, ticket counter, or printer, you’ve already experienced a queue in real life! What is a Queue? A queue is an abstract data type that follows the FIFO principle – ... Read More

Resources: 1. What is Stack? A Stack is one of the most fundamental linear data structures in computer science. If you’ve ever piled up a stack of cafeteria trays or used the “Undo” button in a text editor, you’ve already interacted with a stack in the real world. A stack is a linear data structure ... Read More

Resources: Array Array is one of the most fundamental and widely used data structures. It serves as a building block for more complex structures like heaps, hash tables, and matrices. 1. What is an Array? An array is a collection of items stored at contiguous memory locations. The idea is to store multiple items of ... Read More

T. H. Cormen, Ed., Introduction to algorithms, 2nd. ed., 10th pr. Cambridge, Mass.: MIT Press [u.a.], 2007. Data Structure and Algorithsm, Sixth Edition, GoodRich et al., Wiley What is a data structure? https://www.ibm.com/think/topics/data-structure What are algorithms? An Algorithm is simply a specific, step-by-step set of instructions used to complete a task or solve a problem. ... Read More