What do you know about the big-o notation and can you give some examples with respect to different data structures?
- 1 Answers
- 1022 Views
- I also Faced
- E-Mail Answers
Answer Posted / Vishwajeet
Big O notation is a mathematical notation that describes the time complexity or space complexity of an algorithm. It provides upper and lower bounds on the performance of an algorithm as the size of the input grows. For example, searching for an element in an array (using linear search) has a time complexity of O(n), while searching in a sorted array has a time complexity of O(log n) due to binary search. Insertion into an ArrayList also has a time complexity of O(n) when adding elements at the beginning, but is O(1) when adding them at the end.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What sort of serious problems have you experienced, and how have you handled them?
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
Write a program for Sorting an Array. Which sorting will you prefer?
Can you declare an array without assigning the size of an array?
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.
