Search:

Type: Posts; User: dlcp

Search: Search took 0.01 seconds.

  1. Thread: structures fwrite

    by dlcp
    Replies
    1
    Views
    1,591

    structures fwrite

    i dont know what is the problem, it simply dont write the struct to the file =(



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

    struct restaurant
  2. Replies
    1
    Views
    2,241

    binary tree random access

    hello =D i've looking for some help using the search but couldnt get it.. i need to implement a binary tree and the usual funcions.. and i need a function that shows the in-ordern N element.. i could...
  3. Replies
    5
    Views
    1,265

    here u have the agenda.txt.. rename to...

    here u have the agenda.txt.. rename to agenda.dat..
    about the sorting.. it cant be sorted that way..

    the problem is here


    *temp=curr->data;
    curr->data=menor->data;
    menor->data=*temp;
  4. Replies
    5
    Views
    1,265

    sorting linked list

    well i have a problem sorting the linked list.. its changing the data instead of changing the pointers..

    anything that can be optimized.. i will appreciate too ^^
  5. Replies
    4
    Views
    2,761

    there is some diference betwen (*ptr).data and...

    there is some diference betwen (*ptr).data and ptr->data?
  6. Replies
    4
    Views
    2,761

    linked list program

    well.. this is the starting of my project of C introduction..
    and i wanna know if there is some problem with the code.. and how can it be optimized or sumthing..
    thanks
  7. Replies
    7
    Views
    2,935

    well.. thats probably the point xP.. but how can...

    well.. thats probably the point xP.. but how can i sort the list using an array of pointers? i should look in the list and then change in the array?
  8. Replies
    7
    Views
    2,935

    linked list sorting..

    well i have some kind of problem... the goal is to developt a algorithm to sort a linked list (single or double linked).. that uses the less memory possible.. we can use for exemple auxiliar lists...
Results 1 to 8 of 8