|
Given an array of size n wherein elements keep on increasing monotically .......
Software QA/Tests Interview Questions from Microsoft
(Continued from previous question...)
Given an array of size n wherein elements keep on increasing monotically .......
Q:
Microsoft Interview Question for Software Engineer in Tests about Algorithm
Given an array of size n wherein elements keep on increasing monotically upto a certain location
after which they keep on decreasing monotically, then again keep on increasing, then decreasing
again and so on. Sort the array in place in O(n) and using only O(1) extra memory).
(Continued on next question...)
Other Interview Questions
| 