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.
Answer:
B
Explanation:
In an ERD, the Crow Foot Notation Symbols are used with cardinality.
Hope it helps you
Answer:
A
Explanation:
I think it would be A because i have never heard of a virus scanner
Answer:
All except saving time writing a computer program.
Answer:
Best: 1 or 4
Worst: 3
Explanation:
I'm not sure if number one is imply to ask your coworker to explain it or actually help with the workload. I think 4 would be the right answer because that is what they are there for and you don't want to distract your coworkers.
