Ngân hàng câu hỏi

An array has fixed size and stores elements in contiguous memory; a linked list consists of nodes with data and references, allowing dynamic size.

Time complexity measures the time an algorithm takes relative to its input size, expressed in Big O notation.

A binary search tree is hierarchical, maintaining order; a hash table maps keys to values for fast retrieval, without maintaining order.

A linked list is a series of nodes each containing data and a reference to the next node, allowing dynamic memory allocation and efficient insertions/deletions.

Recursion is when a function calls itself to solve subproblems, with a base case to terminate recursion.

Big O notation describes the upper bound of algorithm time complexity, important for comparing efficiency and growth rates.

Binary search divides the search interval in half, repeatedly comparing the middle element to the target.

Sorting algorithms vary in time/space complexity and stability. Quick Sort and Merge Sort are fast but more complex; Insertion and Bubble Sort are simple but slower.

A hash table uses a hash function to map keys to values in an array, allowing fast O(1) access.

Dynamic programming solves complex problems by dividing them into smaller subproblems, avoiding redundant calculations.