thanks all guy`s , the problem fixed when i change the char to unsigned char , i couldn`t notice that ..
Type: Posts; User: Meshal
thanks all guy`s , the problem fixed when i change the char to unsigned char , i couldn`t notice that ..
point to the first char in a the input file ??
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int main()
{
FILE *out;
FILE *in;
char *ce;
thanks Salem ur the best here ! and i am sure that %100 that you will answer my questions ..
Ops, sorry i found the problem ..
the problem is that i print out the address looooolz... i forget to do this
*ch
thanks zacs for help
there is an error when i use fread() , here`s the problem
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int main(int argc,char *argv[])
{
is there another way other than fread() ??
when i save a file as Unicode every char will be 2-byte long
how can i read it from a file ??
if i use for example
FILE *fp;
c = getc(fp)
try to not use casting so it will be like this :
list_t **list_array = malloc(sizeof(list_t*) * max_size);
thanks guys , finally i got every things works Ok .. "thanks word" is not enough to thank you..
and i appreciate your help all of you .
sorry my english is bad ,
and if i have a struct that contain multiple id`s .. like this :
struct s{
char *id[4] ;
}MyArray[5];
can i do what salem say`s .. or it will be a problem
i mean is this true :
thanks Salem , and is there a way to do it dynamicly ??
this is More advance exmaple :
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MAX2 100
struct s
is this possible ??
struct s{
char *name;
}MyArray[5];
is this will create array of structs or i am wrong because after compiling it i get the same answer ..
exampl when i put to the...
i am very thanks full for all of you guys , my problems in linked lists now fixed, after i try some tests ..
i am so happy right now ..
and i am sorry for bothering you dudes
thanks so much citizen your post help me alot.. @
and what i really want is that i have 2 pointers
first one name root
and the second one name t
the t is a list where i insert something to...
so you mean i cann`t make the root point to the t ?!!
and i must malloc the root before make it point to t .. is this true!
99% percent
ahmet858585 == Meursault
the problem :
the t is a pointer to a struct and the root is another pointer to the struct
if i malloc the t in the second time i will lose the first node and if i make this
root=t;
to keep...
yes i do that ,but the code still not fixed
thanks for help
your post dosn`t fix my problems !!
i try hard but i couldn`t fix the problem?!
This is the source code
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
so how can binary tree or binary search programmed in C# without using real pointers ?!!
how i can reference to point to the bucket ??
can you show me an example ?!