C++ (Cpp) reverse_print Examples

Example #1

File: reverse.c Project: sreejithmm/AlgorithmDS

int main(){

char s[] ="this";
        reverse_print(s);
       printf("%s\n",reverse(s));



}

Example #2

File: reverse.c Project: Jareechang/c-basics

int main()
{
    int c, len;
    char line[MAXLINE];

    while((len = getinput(line, MAXLINE)) > 0) {
        reverse_print(line, len);
    }
    return 0;
}

Example #3

File: reverse.c Project: sreejithmm/AlgorithmDS

void reverse_print(char *str){

//    printf("%c",*str);
    if (*str=='\0')
    {
        return;

    }
    reverse_print(str+1);
    printf("%c",*str);
    printf("\n");
    return;

}

Example #4

File: link_list.cpp Project: kobemiller/mycode

/*
 * 从尾到头反向输出带头结点的单链表的每个节点
 * 思路：递归输出
 * 思路：新建一个单链表，采用头插法将原链表每个值输入到新链表中，然后再输出
 */
void reverse_print(LinkList p)
{
    if ( p->next )
        reverse_print(p->next);
    printf("%d ", p->data);
}

Example #5

File: link_list.cpp Project: kobemiller/mycode

int main()
{
    LinkList La, Lb, Lc;
    ElemType e;
    int i;

    InitList(La);
    InitList(Lb);
    InitList(Lc);

    for ( i = 0; i < 10; i++ )
        ListInsert(La, 1, (i+1)% 4);
    ListTraverse(La, print);

    delete_x(La, 3);
    ListTraverse(La, print);

    ClearList(La);
    for ( i = 0; i < 10; i++ )
        ListInsert(La, 1, i+1);
    ListTraverse(La, print);
    reverse_print(La->next);
    printf("\n");

    delete_min(La);
    ListTraverse(La, print);
    
    reverse(La);
    ListTraverse(La, print);

    delete_between_min_and_max(La);
    ListTraverse(La, print);

    ClearList(La);
    for ( i = 0; i < 10; i++ )
        ListInsert(La, 1, i+1);
    ListTraverse(La, print);
    print_and_delete_sorted(La);

    ClearList(La);
    for ( i = 0; i < 10; i++ )
        ListInsert(La, 1, i+1);
    ListTraverse(La, print);
    split(La, Lb);
    ListTraverse(La, print);
    ListTraverse(Lb, print);

    ClearList(La);
    for ( i = 9; i > 6; i-- )
        ListInsert(La, 1, i);
    for ( i = 7; i > 5; i-- )
        ListInsert(La, 1, i);
    for ( i = 6; i > 4; i-- )
        ListInsert(La, 1, i);
    ListTraverse(La, print);
    Delete_repeat_sorted(La);
    ListTraverse(La, print);

    ClearList(La);
    ClearList(Lb);
    for ( i = 10; i > 0; i-- )
    {
        ListInsert(La, 1, i);
        ListInsert(Lb, 1, i*2);
    }
    ListTraverse(La, print);
    ListTraverse(Lb, print);
    merge_sorted(La, Lb);
    ListTraverse(La, print);

    ClearList(La);
    InitList(Lb);
    for ( i = 10; i > 0; i-- )
    {
        ListInsert(La, 1, i);
        ListInsert(Lb, 1, i*2);
    }
    ListTraverse(La, print);
    ListTraverse(Lb, print);
    merge_common(La, Lb, Lc);
    ListTraverse(Lc, print);

    ClearList(La);
    ClearList(Lb);
    for ( i = 10; i > 0; i-- )
        ListInsert(La, 1, i);
    for ( i = 6; i > 2; i-- )
        ListInsert(Lb, 1, i);
    ListTraverse(La, print);
    ListTraverse(Lb, print);
    child_sequence(La, Lb);

    search_k(La, 4);

    return 0;
}