Answer:
O(n²)
Explanation:
The worse case time complexity of insertion sort using binary search for positioning of data would be O(n²).
This is due to the fact that there are quite a number of series of swapping operations that are needed to handle each insertion.
A. How many marathons you have run, because it doesn't relate to the job you're applying for.
Answer:
following types of databases available in the market −
Centralised database.
Distributed database.
Personal database.
End-user database.
Commercial database.
NoSQL database.
Operational database.
Relational database.
Cloud database.
Object-oriented database.
Graph database
Answer:
=IF(E4<=F4, “Reorder”,”No”)
Explanation:
If the question is true or false, it is <u>false</u>. Also assuming you are referring to Excel or similar spreadsheet programs.
