Explanation

for loops are ideal for iterating over rows and columns in 2D arrays with known sizes.

Nested for loops provide clear structure and indexing for accessing array elements.

Explanation

while loop is ideal when iterations depend on a condition rather than a fixed count.

It continues looping until the condition becomes false, making it flexible for unknown iterations.

Explanation

switch handles multiple discrete values of a variable more clearly than nested if-else statements.

It improves readability and structure in complicated decision-making scenarios.

Explanation

Standard C (before C99) does not have a built-in bool type; _Bool was introduced in C99.

int, long, and char are standard primitive data types in C.

Explanation

2's complement allows easy addition and subtraction of signed integers without extra logic.

It eliminates the problem of having two zeros, unlike sign-magnitude or 1's complement.

Explanation

unsigned int cannot store negative numbers, so its range shifts from -2³¹ to 2³¹-1 to 0 to 2³²-1.

The memory size remains the same (4 bytes).

Explanation

Insertion in a binary heap requires adding the element at the end and then heapifying up to maintain heap property.

The heapify operation takes logarithmic time relative to the number of elements.

Explanation

Explanation

Quick Sort has an average-case time complexity of O(n log n), making it faster than simple sorts like Bubble or Insertion.

It works efficiently with large datasets due to its divide-and-conquer strategy.

Explanation

Hash Set is a collection that stores unique elements only, automatically ignoring duplicates.

It provides fast lookup and ensures data uniqueness.

It is commonly used in databases and programming applications.