Problem:
Question 1- How to keep on rotating a pentagon clockwise in c++?
Question 2- In the analysis of binary search, we assumed that n is a power of 2. This means that n is even (unless it is 1), so there is no middle element. Which element does binarySearch() examine first?
Step by step instructions so I can understand would be greatly appreciated!