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:
The answer with explanation is attached in the file.
Explanation:
AnswerB
Explanation:Makes since to look over the notes each night before the exam
It really depends on what you're using it for such as looking up a recipe or an answer to a question. If you're using it for illegal purposes or looking up things that are seen as morally wrong by other people it can make the internet seem like a bad thing. But the internet wasn't created with that intended purpose so again it's just your own personal opinion.
