Thanks! Your tips was very helpful.. 😊

Admins, could i push a CppCon promo here ? :)

Can any one tell me best algorithm for rotate a array??

Can any one tell me best algorithm for rotate a array??

Let say a name "danya" and I want to rotate it like "adany"

Let say a name "danya" and I want to rotate it like "adany"

Let say a name "danya" and I want to rotate it like "adany"

Are u sure if you use array rotating algorithm you will be able to go from "danya" to "adany" ? I think you will have "aynad" if you rotate completly.

Are u sure if you use array rotating algorithm you will be able to go from "danya" to "adany" ? I think you will have "aynad" if you rotate completly.

Rotating through right gets the last element and put as the first of the array, and everything else is shifted right.

No, it is rotating with step=1

Yeah ! I think we are saying the same thing but i was thinking about a complete rotation.

It would become danya again.

well, lets see: this will br just a pseudocode because i am lazy. char arr[4] = "caio"; int shift = 1; for (i=0; i < size) { if ( i < shift ) { temp[i] = arr[size+i-shift]; } else { temp[i] = arr [i+shift] } } return temp I think that would work. Not sure tho

#include <stdio> int main () { char test[6] = "danya"; char tmp; int size = 0; int i = 0; // finding the size of the array while(test[size] != '\0') size++; // rotation i = size - 2; tmp = test[size-1]; while (i != 0) { test[i+1] = test[i]; i--; } test[i+1] = test[i]; test[0] = tmp; printf("%s", test); }

#include <stdio> int main () { char test[6] = "danya"; char tmp; int size = 0; int i = 0; // finding the size of the array while(test[size] != '\0') size++; // rotation i = size - 2; tmp = test[size-1]; while (i != 0) { test[i+1] = test[i]; i--; } test[i+1] = test[i]; test[0] = tmp; printf("%s", test); }

For the size, you can just go with sizeof(test)/sizeof(char)

For the size, you can just go with sizeof(test)/sizeof(char)

There are better ways but in C++

Maybe but I understand the C strings more than the C++ strings. That's why i use C here.

#include <stdio> int main () { char test[6] = "danya"; char tmp; int size = 0; int i = 0; // finding the size of the array while(test[size] != '\0') size++; // rotation i = size - 2; tmp = test[size-1]; while (i != 0) { test[i+1] = test[i]; i--; } test[i+1] = test[i]; test[0] = tmp; printf("%s", test); }

I'm talking about sizeof(arr)/sizeof(arr[0]) and similar

And you know the array size in compile time, why did you calculated the size at runtime???

And yeah — for the C strings, there is the strlen function

This is a powerful way to get the size. strlen is a function which means there can be a longer execution time if i use it.

Using built-in functions in 95% is faster and safer

There are better ways but in C++

🤦‍♂ safer maybe but not compulsory faster.

Again, who said to you?!

There's no possible way that your algorithm is faster than the same one from stdlib

There's no possible way that your algorithm is faster than the same one from stdlib

My books, my courses Dude. And who said to you too that built-in functions are faster ?

Just like STD::sort

Are you saying that you sort is faster than std::sort?😂

Those who wrote stdlib are human beings just like us and we can beat them.

That is basically why performance-wise, the more low level the language the better, because the programmer has total control of his software

They are smarter than you, admit that

Merge sort

n² complexity

So? IntroSort that used in some implementation is faster than Merge Sort

But C++ sort is QuickSort

General sense and some really smart people from c++ standard committee

Any have knowledge java

Yes it is.

They are smarter than you, admit that