Chapter 5: Searching

Searching efficiency depends on:

Binary search divides list repeatedly into:

Which search gives fastest result ideally?

Which search is best for large sorted data?

Which search is best for unsorted data?

Hashing avoids:

Good hash function should be:

Load factor affects:

Hashing is useful in:

Hashing is fastest in:

Collision resolution methods include:

Collision occurs when:

Hash table stores:

Hash function maps:

Hashing provides:

Number of steps in binary search depends on:

Binary search is ideal for:

Binary search best case:

Middle index formula:

Binary search can be implemented using:

Binary search fails if:

Binary search is faster than linear because:

Worst-case comparisons:

Binary search reduces search space by:

If key > middle element:

If key < middle element:

Time complexity of binary search:

Binary search follows:

Binary search compares with:

Binary search requires:

Linear search is inefficient for:

Linear search uses:

Number of comparisons if element not found:

Linear search is suitable for:

Time complexity of linear search:

Linear search stops when:

Best case in linear search occurs when:

Worst-case comparisons in linear search:

Linear search works on:

Linear search compares elements:

Searching is important in:

If element not found, result is:

Searching is used to:

Hashing is used for:

Binary search works on:

Linear search is also called:

Which is the simplest searching method?

Searching returns:

The element to be searched is called:

Searching means: