Array - Rotation using C++

[@codewhoop]

Website Link: www.codewhoop.com/array/rotation.html
Support Us: www.patreon.com/codewhoop

[@disenchantedcardgd9878]

may someone explain the logic behind this? ye okey it works for values cool, but how does one come up with this?

[@Muskan-DataNaari]

Great explanation, made it very clear! thank you :)

[@saimadib]

Bruh very awesome how have you think of these algorithm in new temp array?

[@grin09]

Is the program of left and right are same?

[@unknown_rude744]

Very nice and simple concept

[@OmKumar-js7jd]

Fantastic presentation ❤️

[@ShivamGupta-ou1lx]

Great explanation🔥

[@abhiG_]

Great man u must have given a lot of thought to create that formula

[@Fourtyseven0047]

Bhai ye formula isne nhi bnaya ....

[@muhammadsaim403]

Please Sir
Start making videos regularly

[@mohitarya5189]

tremendous bro

[@glennmathewgarma8565]

Nice tutorial! Thanks!

[@ketkisingh5504]

thanks a lot :)

[@BladeAndrade]

what is the formula for left rotation?

[@abhishekpanda3400]

arr[i] = arr[(i+N-k)%N]

[@rajdeepkundu5107]

@@abhishekpanda3400 the formula you gave above is for right rotation. In this video he actually explains left rotation.

[@quranosunnattv3714]

Thank you sooo much dude

[@Deepakkumar-is5ee]

Great brother 👍🏻

[@rahulagarwal8059]

Nice

[@rajdeepkundu5107]

This is left rotation and not right rotation. Since you are using an array of size 4 so it seems the same thing here. Try for larger array size and see that this is the concept for left rotation.
For right rotation: arr[i] = arr[(i+N-k)%N] , k = no. of rotations; N = array size
Request you to please upload the video again otherwise it will confuse students.

[@kothekarswaraj]

ya but this can also be called as right shifting of array elements

[@abhinashbihari2881]

But this is not optimised solution.In this case Time complexity will be O(n*k) but for optimised solution time complexity will be O(n)

[@ameygadhe6437]

bro use the rotate function it has time complexity of o(n)

[@animeprofiles2077]

How about to the left

[@abhishekpanda3400]

arr[i] = arr[(i+N-k)%N]

[@GuyKroizman]

There is already a standard function in C++ which does rotate.

[@musicislife1844]

thank you very much

[@563woodcock]

very good video sir

[@codewhoop]

Thank you :D

[@johnmathai2611]

Nice tut +1

[@codewhoop]

Thank you :)

[@divyanshrawat2859]

Anyone its time and space complexity please ?

[@shahrukh631]

Is this even allowed B[n] ? :/

[@2aMaK]

Could you please do one with in-place k rotation?

[@codewhoop]

Sure !! will work on it soon :)

[@codewhoop]

There you go :) www.codewhoop.com/tutorial/array-rotation-in-place

[@2aMaK]

THANK YOU!

[@johnliu8715]

What is the difference between this video and the in-place k rotation?

[@codewhoop]

method in this video has space complexity of O(n) as we are using another array of the same size.

[@prabhuchopra9266]

formula for left rotation?

[@abhishekpanda3400]

arr[i] = arr[(i+N-k)%N]

[@AjinkyaBobadepictpune]

nice

[@codewhoop]

Thanks !!

[@yazanhassan9350]

Nice Nice Nice Nice Nice Nice Nice Nice :)

[@codewhoop]

Thank you 😁

[@ahmadr299]

I want a code

[@hayyanali7111]

I want a binod