OS Data Structures Question:
What is a complexity of linear search, binery search?
Answer:
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
until the required element got searched whereas in binary
search array is divided into two and required element is
searched
| Previous Question | Next Question |
| What are input function and output function in c language? | What is AVL tree? |