rotate my anus

sup /prog/, I wrote this in c#, and it seems that I'm too stupid to reverse this to write a rotate right algorithm. can you halp?


    /// <summary>
    /// rotates the chars in a string to the left p times
    /// </summary>
    /// <param name="v">value to rotate</param>
    /// <param name="len">value length</param>
    /// <param name="p">places to rotate</param>
    /// <returns></returns>
    static string rotl(string v, int len, int p)
    {
        char[] o = new char[len];

        for (int i = 0; i < len; i++)
        {
            o[i] = v[(i + p) % len];
        }

        return new string(o);
    }

I wrote this in c#
Now you have two problems

//assuming you're not using negative numbers

int i = len; i>0; i--

//using negative numbers
int i=0; i>i-len; i--

static string rotr(string v, int len, int p){
        char[] o = new char[len];
        p = len - p;

        for (int i = 0; i < len; i++)
        {
            o[i] = v[(i + p) % len];
        }

        return new string(o);
    }
well that was hard.

>>3

for (int i = len; i > 0; i--)
{
     o[i] = v[(i + p) % len];
}

index was outside the bounds of the array o-o

>>4
thanks

>>5

Oh yeah... int = len-1

but yeah 5 has it as well.

>>3,5,7
hey fill me in, what does the order you traverse the array have to do with the direction the characters have shifted?

>>8
Uh... everything?

>>9
everything eh?
are you sure it's not NOTHING?
because I think it might be NOTHING.

>>10
No, no, I'm pretty sure it's everything.

anus@anustop:~$ gcc -o test test.c
anus@anustop:~$ ./test faggot 6 2
faggot
ggotfa
otfagg
anus@anustop:~$ gcc -D FAIL -o test test.c
anus@anustop:~$ ./test faggot 6 2
faggot
ggotfa
ggotfa

#include<stdio.h>
#include<stdlib.h>

char* rotl(char v[], int len, int p){
    char *o;
    int i;

    o = malloc(sizeof(char) * len);

    for (i = 0; i < len; ++i)
      o[i] = v[(i + p) % len];

    return o;
}

#ifdef FAIL
char* rotr(char v[], int len, int p){
    char *o;
    int i;

    o = malloc(sizeof(char) * len);

    for (i = len-1; i >= 0; --i)
      o[i] = v[(i + p) % len];

    return o;
}
#else
char* rotr(char v[], int len, int p){
    return rotl(v,len,len-p);
}
#endif

int main(int argc, char *argv[]){
    char *o, *p;
    if(argc != 4)
      return 1;

    printf("%s\n%s\n%s\n",
           argv[1],
           o = rotl(argv[1],atoi(argv[2]),atoi(argv[3])),
           p = rotr(argv[1],atoi(argv[2]),atoi(argv[3])));
    free(o);
    free(p);
    return 0;
}
I'm starting to suspect the order you traverse the array has nothing to do with the shift in characters. Can you give me your satori-level analysis >>9 ? Because I'm still not sure.

Dear Lord, OP, what the fuck. At least try and use your fucking brain every once in a while, please.

16 Name: Anonymous 2011-02-04 15:49