Algo-Tree
Algo-Tree copied to clipboard
Count of rotation in a sorted array
In this, we are given a sorted array of n elements which has been rotated clockwise k number of times. Here we will output the number of times the given array has been rotated i.e., k.
Example - Input: n = 6 a[] = {6, 5, 4, 1, 2, 3} Output: 3 Explanation: Since the sorted array is rotated 3 times.
I am a participant in GSSoC 2021. Can I work on this issue under GSSoC 2021? I would like to add the solution to this problem in c++.
I'm a GSSOC'21 participant and I would like to work on this issue. I will write clean code and use proper comments. Thank you.
@rudrakshi99 Kindly assign me this issue.
Hey, Can you assign me this issue as no one is working on it.
Hey @alkatrivedi kindly follow the guidelines #1153
Hi, I am GSSOC'21 participant. I want to solve this issue in Python. Please assign this to me.
@Rohan27s please review my pr
I would like to contribute to the above code in java. Kindly assign this to me. Thanks.