Answer / pushpendra

array is faster than pointer because accessing array elements
by pointers always faster.there is used one array and more pointer.we know pointer is a "value at address".
so pointers stores only address of variable but arrays are stores similar data types.

Answer / andeep singh

Pointer is faster than array if there is only one pointer used

Answer / narendra

arrays are very faster because it stores a sequential


block of memory and similar data types

pointers stores only adders of variable

but arrays are stores similar data types

Answer / s

i think pointers are faster if we talk in terms of element
addition and deletion,the priomary req..

Answer / sandeep

when compared pointers work fast ,beacause:
1.array too is pointer
eg:char s[20];
gets(s);
here we are supplying base address.
2.array notation will be inter coverted as pointers
where we can directly use pointers.

char p="data"; printf(p);

2 Answers  

Write a function in c to find the area of a triangle whose length of three sides is given.

2 Answers  

write an algorithm to display a square matrix.

0 Answers  

What oops means?

0 Answers  

6)swap(int x,y) { int temp; temp=x; x=y; y=temp; } main() { int x=2;y=3; swap(x,y); } after calling swap ,what are yhe values x&y?

3 Answers  

Describe static function with its usage?

0 Answers  

Define VARIABLE?

0 Answers   ADP,

YBJBU6

1 Answers  

Explain how do I determine whether a character is numeric, alphabetic, and so on?

0 Answers  

Explain what is a 'null pointer assignment' error? Explain what are bus errors, memory faults, and core dumps?

0 Answers  

C program execution always begins with a) #include b) comment (/*-------*/) c) main() d) declaration instructions

0 Answers  

1234554321 1234 4321 123 321 12 21 1 1 12 21 123 321 1234 4321 1234554321

0 Answers