GitHub - Tabed23/Shifts_in_data: You are given a sorted array of N elements. But unfortunately the array has been circularly shifted 0<K<N times and you don’t know that K. Design the following algorithm: Detect How many times the array has been circularly shifted, find the K. Your Algorithm should run in O(log N) time and Design an O(N) algorithm which should undo those rotations in such a way that now the array is sorted again.

Tabed23 / Shifts_in_data Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

You are given a sorted array of N elements. But unfortunately the array has been circularly shifted 0<K<N times and you don’t know that K. Design the following algorithm: Detect How many times the array has been circularly shifted, find the K. Your Algorithm should run in O(log N) time and Design an O(N) algorithm which should undo those rotatio…