What is the time complexity of searching for an element in an unsorted array of elements using linear search?
Answer and explanation
Correct answer: D.
- Step 1: In an unsorted array, the target element could be located at any index or absent entirely.
- Step 2: In the worst case, every element must be inspected sequentially, resulting in linear time complexity .
Answer
.
Why not the others: '' is constant time lookup by direct index; '' is binary search in a sorted array; '' represents nested loops.
Practise more Python Programming, Data Structures, Algorithms, Networks and Cybersecurity.
Free questions with an explanation for every one, and full timed Saudi Secondary School Certificate mock tests.
More Python Programming, Data Structures, Algorithms, Networks and Cybersecurity questions
- What is the output of the following Python expression: `[x**2 for x in range(5) if x % 2 == 1]`?
- Which data structure operates on a Last-In, First-Out (LIFO) access principle?
- Which SQL clause is used to filter aggregated group records after a `GROUP BY` statement has been applied?
- What type of network topology connects all nodes to a central forwarding device such as a network switch?
- In cybersecurity, what type of malicious attack overwhelms a web server with massive volumes of traffic from multiple compromised sources to…
- What is the binary representation of the decimal integer 25?