I am referring to this statement
Type: Posts; User: C_Enthusiast
I am referring to this statement
Ok I got my mistake as f and g are global arrays...
But I want to know that is my statement correct if they would have been defined in main function as then memory will be assigned to them in stack...
C has no bound checking... So this is valid as f and g are allocated memory continuously with f below g...
So f[5] is valid...
Hope this helps...
To declare array of pointers use calloc function...
char **s=(char**)calloc(size of array,sizeof(char*))
Now doing
s[i] =(char *)malloc(10 * sizeof(char));
will be valid...
This shows initialization with null character...
Hi all,
#include<stdio.h>
int main()
{
char p[]="hello";
printf("sizeof(p)=%d\n",sizeof(p));
Hi all,
I want to know the about the practical applications of minimum spanning trees ???
Please help
Regards
C_Enthusiast
Hi all,
I want to know that how one can make a good selection of span sequence in shell sort...????
Please help...
Regards
C_Enthusiast
please help....
giove is right... That will work
hi Niels_M,
Its because the name of the 2*2 matrix intarr is a pointer to an array of two pointers each of which point to a row of the matrix.....
So that is why you have to inform the...
Hi all,
Nothing better that this I can provide... This shows a linked list and the corresponding tree representation in which the internal nodes contain the number of linked list nodes present to...
I am still here....
I cannot provide any pictures butt his idea of representing list using trees is given in book data structures using c and c++ by tenanbaum... page number 308 section 5.4
I am...
The above code is just to create a binary tree... I want to create a tree in which external nodes represents linked list nodes and internal nodes contain the count of linked list nodes to their left...
I want inorder taversal... Kindly tell the technique not the structure for nodes..
Thanks in advance
Hi all,
Can someone help in devicing an efficient method for building a tree for representing a list as list represented using trees take less time to traverse and delete...
Thanks in advance
...
Hi all,
I wrote the following code to add two very long positive integers... Numbers are stored in doubly linked list....But it gives segmentation fault... Can someone please check it and help.......
Hi all,
Now one more error I am getting...
#include<stdio.h>
int main()
{
char str[20];
Hi iMalc,
Well thanks for testing me also....
p is a constant pointer and once made to point somewhere it cannot be made to point to any other location... But certainly p can change he contents...
The thread is to long and shook my head.... But it was really helpful... Thanks
Ok so I got why gets() is bad...
But I want to know that is using getline() for accepting accepting strings...
Hi all,
Thanks for clearing my doubts about the previous questions...... I am grateful to all of you...
Now I am using gets() functions to accept a string but the gcc compiler reports the...
Hi all,
Please help me understanding the applications of priority queues as I am new to the subject od data structures....
Thanks in advance
Regards
C_Enthusiast