Why (theta) Ó¨-notation is suitable to insertion sort to describe its worst case running time?

The best case running time of insertion time is Ó¨(n) and worst case is Ó¨(n^2) to be precise. So the running time of insertion sort is O(n^2) not Ó¨(n^2). O(n^2) means that the running time of the algorithm should be less than or equal to n^2, where as Ó¨(n^2) means it should be exactly equal to n^2.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.