Return to Question

int cycle_head(int *perm, int idx) {
    int i = perm[idx]
    int j = i
    while (1) {
        j = perm[j]
        if (j == i) return 1
        if (j < i) return 0
    }
}

int cycle_head(int *perm, int idx) {
    i = perm[idx]
    j = i
    while (1) {
        j = perm[j]
        if (j == i) return 1
        if (j < i) return 0
    }
}

int cycle_head(int *perm, int idx) {
    i = perm[idx]
    j = i
    while (1) {
        j = perm[j]
        if (j == i) return 1
        if (j < i) return 0
    }
}

int cycle_head(int *perm, int idx) {
    int i = perm[idx]
    int j = i
    while (1) {
        j = perm[j]
        if (j == i) return 1
        if (j < i) return 0
    }
}