Exploring Searching Algorithms

What is a searching algorithm?

• A searching algorithm is a method for deleting items from a data structure.

• A searching algorithm is a method for finding a specific item in a data structure.

• A searching algorithm is a way to sort data in a structure.

• A searching algorithm is a technique for compressing data.

Name two types of searching algorithms.

• Linear Search, Binary Search

• Jump Search

• Breadth-First Search

• Depth-First Search

What is the time complexity of linear search?

• O(n^2)

• O(1)

• O(log n)

• O(n)

How does binary search work?

• Binary search efficiently finds a target value in a sorted array by dividing the search interval in half.

• Binary search requires the array to be in descending order.

• Binary search works by searching through an unsorted array.

• Binary search finds the target by checking each element sequentially.

What is the prerequisite for using binary search?

• The data must be unsorted.

• The data must be in binary format.

• The data must be sorted.

• The data must be in ascending order.

Explain the difference between linear search and binary search.

• Linear search is sequential and works on any list; binary search is faster, requires a sorted list, and divides the search space in half.

• Binary search works on any list and is sequential.

• Linear search is faster and requires a sorted list.

• Linear search divides the search space in half.

What is the worst-case time complexity of binary search?

• O(1)

• O(n log n)

• O(log n)

• O(n)

In which data structure is binary search typically used?

• Sorted array or sorted list

• Linked list

• Binary tree

• Unsorted array

What is a hash table and how does it relate to searching?

• A hash table is primarily used for sorting data in ascending order.

• A hash table is a linear data structure that stores elements in a sequential manner.

• A hash table is a type of database used for storing large amounts of data.

• A hash table is a data structure that allows for efficient searching of key-value pairs using a hash function.

Describe the concept of a search tree.

• A search tree is a data structure that represents possible states in a search problem, with nodes for states and edges for actions.

• A search tree is a method for organizing files on a computer.

• A search tree is a graphical representation of a database schema.

• A search tree is a type of binary tree used for sorting data.