what is a complexity of linear search,binery search?
- 10 Answers
- 41218 Views
- ABB, Google, I also Faced
- E-Mail Answers
Answer Posted / guest
in linear search each element in the array should be checked
until the required element got searched whereas in binary
search array is divided into two and required element is
searched
| Is This Answer Correct ? | 28 Yes | 1 No |
Post New Answer View All Answers
What sort of serious problems have you experienced, and how have you handled them?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
Can you declare an array without assigning the size of an array?
Write a program for Sorting an Array. Which sorting will you prefer?
