How pointer is benefit for design a data structure algorithm?
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 |
write a own function for strstr
code for selection sort?
what is different between auto and local static? why should we use local static?
What is this infamous null pointer, anyway?
What is the best way of making my program efficient?
What is null in c?
an algorithem for the implementation of circular doubly linked list
Give the rules for variable declaration?
When can you use a pointer with a function?
#define d 10+10 main() { printf("%d",d*d); }
What does static mean in c?
Write a code to reverse string seperated by spaces i/p str=India is my country o/p str=aidnI si ym yrtnuoc After writing code, optimize the code