why array index always starts from zero??
Answers were Sorted based on User's Feedback
It uses the concept of Binary digits. Take an array size of 64 for example. We start from 0 and end at 63,
We require 6 bits.But, if we were to start from 1 and end at 64, we would require 7 bits to store the same number,
thus increasing the storage size.
| Is This Answer Correct ? | 3 Yes | 0 No |
Answer / bijayalaxmi behera.
The index of an array is an OFFSET from the beginning of the
array, multiplied by the width of the array items:
Say an array of integers, 4 bytes long.
Say beginning of array at address 0x1000
First integer address: BaseAddress + (index * len) = 0x1000
+ ( 0 * 4) = 0x1000
Second integer will be at : 0x1000 + ( 1 * 4 ) = 0x1004.
| Is This Answer Correct ? | 4 Yes | 6 No |
Answer / nobody special
because starting from 3 would just be silly?
| Is This Answer Correct ? | 1 Yes | 9 No |
What is an lvalue in c?
Which of the Following is not defined in string.h? A)strspn() B)strerror() C)memchr() D)strod()
what is a stack
What are the differences between Structures and Arrays?
What is the memory allocated by the following definition ? int (*x)[10];
HOW TO SWAP TWO NOS IN ONE STEP?
count the numbers between 100 and 300, that star with 2 and ends with 2
what does the following function print? func(int i) { if(i%2)return 0; eale return 1; } main() { int =3; i=func(i); i=func(i); printf("%d",i);}
What is the value of y in the following code? x=7;y=0; if(x=6) y=7; else y=1;
What is an example of enumeration?
write a C code To reverse a linked list
My teacher ask to make a program that can: Insert record in front Insert record at the end Insert in between Search node record Delete record in front Delete record at the end Delete record in between Using Data structure Linked List type. But I'm really confused about the codes and I can't go through. Please help Thanks in advance. Also here is my unfinished code if someone can make changes it will be more good.