Computer Science Level 3
TASC Computer Science External Assessment — Tasmania
Full question bankEnglish
Exam overviewPractice session
Which of the following best describes the worst-case time complexity of a Binary Search algorithm operating on a sorted array of N elements?
Loading your practice session…