How pointer is benefit for design a data structure algorithm?
- 2 Answers
- 4342 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / kaushal vinayak
Pointer is that variable who store the address of the
variable.In data structure a node consist of two part data
and link part,where link part consist of hold the address of
the next node which is possible through pointer which
points to next node. through pointer you can go to the next
node in any defined data structure.
| Is This Answer Correct ? | 10 Yes | 0 No |
Answer / deepu.
I am cheking.by useing
pointer we save the
memory.
| Is This Answer Correct ? | 2 Yes | 0 No |
how to calculate the time complexity of a given algorithm? pls give exaples..mainly for the coplexities such as O(log n),O(n log n)...
simple program of graphics and thier outpu display with a want what is out put of graohics in c language
why return type of main is not necessary in linux
string reverse using recursion
What is c language in simple words?
Explain what happens if you free a pointer twice?
Why do we use header files in c?
In the following control structure which is faster? 1.Switch 2.If-else and which consumes more memory?
How can I prevent another program from modifying part of a file that I am modifying?
Want to know how to write a C program that connects to a MySQL server and checks if the InnoDB plug-in is installed on it. If so, your program should print the total number of disk writes by MySQL.
What is #error and use of it?
What is ambagious result in C? explain with an example.
C 
