Arrays ko samjhein
Element count, contiguous storage, initialization, indexing aur permitted one-past boundary ko jodein.
Is chapter mein9 sections
Array ek type ke elements ki fixed sequence hold karta hai. Pointer se access karne se pehle element count, valid indexes aur layout ko jodenge. Sequence ki boundary jaanna har valid access ka hissa hai.
Ideas ko saath rakhkar samajhna hai? Concept guide kholein.
1. Array ke elements, order aur bound hote hain
Array apne element type ke contiguous elements contain karta hai. int readings[3] teen integer elements define karta hai, jinke indices 0, 1 aur 2 hain. Bound element count hai, last valid index nahi. Har element ko us type ke doosre object ki tarah use kar sakte hain; complete array ka apna array type aur size hai.
- index 012
- index 115
- index 218
- index 3Boundary
int readings[3] = {12, 15, 18};
readings[1] = 16;
Numbered lockers ki row useful analogy hai: har position ka predictable neighbor hai. Limit yeh hai ki C har locker par guard require nahi karti. Ordinary subscripting mein implementation ko har out-of-bounds use diagnose karna required nahi. “Agla address kahin exist karta hai” se woh is array ka element nahi ban jaata.
2. Initialization starting values decide karti hai
int readings[4] = {12, 15};
Jab initializer fixed-size array ke elements se kam values deta hai, remaining integer elements zero se initialize hote hain. Yeh language ka initialization rule hai. Bina initializer wali automatic array ko yeh promise nahi milti: suitable values assign kiye bina uske indeterminate elements read na karein. Static storage duration wali array explicit initializer ke bina bhi zero initialization paati hai.
Array object apni lifetime mein resize nahi hota. Bound calculate karne mein used variable change karne se existing array stretch nahi hoti. Allocation functions se allocated storage later replace ho sakti hai; woh separate operation hai jiske apne lifetime aur pointer rules hain. Whole arrays assignable nahi hoti, though individual elements modifiable ho sakte hain aur containing structure structure-assignment rules ke under copy ho sakti hai.
3. Pointer steps elements count karte hain
Array ke suitable pointer mein one add karna next element tak advance karta hai, universally next byte tak nahi. int * ka step array representation mein sizeof(int) bytes se correspond karta hai; char * ka step ek C byte hai. Valid subscripting mein a[i] ka meaning *(a + i) hai. Access ke liye index ko ab bhi valid element identify karna hoga.
Neeche expressions mein array name first element ka pointer supply karta hai. Next lesson conversion aur uske important exceptions explain karega; array object khud array rehta hai.
int readings[3] = {12, 15, 18};
int *end = readings + 3;
int total = 0;
for (int *current = readings; current != end; ++current) {
total += *current;
}
Loop one-past pointer se compare karta hai aur usko dereference karne se pehle rukta hai. Arithmetic mein original aur resulting pointer dono same array ya uski one-past position mein hone chahiye. Usse farther pointer banana hi rule ke bahar hai; later check usko undo nahi karta. Subtraction ke liye same array ya uski one-past position aur ptrdiff_t mein representable result chahiye.
4. Boundary extra element nahi hai
Teen elements mein readings[3] read ya write karna invalid hai; index 2 last element hai. i < count wala loop often is model se match karta hai, jabki i <= count often extra access include karta hai. Expression ko correct integer types, trustworthy count aur us count ke liye sufficiently large array ab bhi chahiye.
Multidimensional array mein har row khud array hai. Ek row ke end ke bahar access sirf isliye valid nahi hota ki larger object mein next row uske baad hai. Two-dimensional arrays aur pointers ke connection mein pointer-to-row type use karenge.
5. Runtime-sized arrays ke bhi rules hain
Supported implementation mein variable-length array runtime par evaluated bound le sakti hai. Aisi bound positive honi chahiye aur evaluation ke baad us particular instance ka size fixed hai. Iska matlab zyada input aane par array automatically grow nahi hogi. Large automatic arrays execution environment ke available resources bhi exceed kar sakti hain.
Primary references aur aage padhne ke liye
- WG14 N1570 — public C11 committee draft: 6.2.5p20, 6.5.2.1, 6.5.6, 6.7.6.2, 6.7.9. Yeh stable rules C17 baseline ko support karte hain; yeh draft final ISO publication nahi hai.
- WG14 N3096 — public C23 draft: 6.7.6.2 and the __STDC_NO_VLA__ feature-macro rules. Draft wording; implementation support separately check karein.
Array ek object hai, pointer variable nahi
Idea compare karein, follow karein aur samjhayein
Ek array instance mein ek type ke fixed number of elements hote hain. Bahut se expressions mein uska naam first element ke pointer mein convert hota hai. Is conversion se array object, pointer object nahi ban jaata.
Yeh kab kaam aata hai Actual array ka element count nikaalte waqt, array data function ko dete waqt aur subscript check karte waqt yeh difference kaam aata hai.
Ideas ko saath rakhkar padhein
- Array marks
- marks ka type array of 3 int hai. Uske storage mein teen int elements hain.
- Pointer p
- p ka type pointer to int hai. Use doosri pointer value assign kar sakte hain.
Array expression aksar pointer deta hai, lekin dono types alag hain.
- sizeof marks
- Is actual non-VLA array ke saare teen elements ka storage measure hota hai.
- sizeof p
- Pointer object measure hota hai, usse reachable storage nahi.
Element-count formula ke liye actual array chahiye, pointer parameter nahi.
- marks + 2
- Last element ko point karta hai. Array alive ho to ise access kar sakte hain.
- marks + 3
- One-past position hai. End mark kar sakti hai, par wahan read karne ke liye element nahi.
Legal pointer position hamesha legal dereference position nahi hoti.
Reasoning ko follow karein
Example mein ek function ke andar actual three-element array hai. size_t ke liye <stddef.h> available hai.
C17 · diye gaye context ke illustrative fragments
int marks[3] = {3, 6, 9};size_t count = sizeof marks / sizeof marks[0];int *p = marks;int last = *(p + 2);int *end = marks + count;
- Array initialize karein
marks[0], marks[1] aur marks[2] mein 3, 6 aur 9 hain.
- Element count nikaalein
sizeof marks, sizeof marks[0] ka teen guna hai; quotient 3 milta hai. int ka fixed byte size assume nahi karna padta.
- p initialize karein
Is initializer mein marks apne first element ke pointer mein convert hota hai. p yeh value store karta hai.
- Last element access karein
p + 2, marks[2] ko point karta hai. Dereference karne par 9 milta hai.
- End position banayein
marks + count array ke one-past hai. Example is pointer ko banata aur compare karta hai; dereference nahi karta.
Common misconceptions
Yeh statements misleading hain. Kyun, yeh samajhne ke liye har statement kholein.
MisconceptionArray ka naam ek pointer variable hai.
Array ka naam array object ko designate karta hai. Bahut se uses mein expression pointer value mein convert hota hai, par marks = p se array ko reassign nahi kar sakte.
MisconceptionFunction parameter int a[3] se teen elements ki copy pass hoti hai.
Array parameter declaration pointer parameter mein adjust hoti hai. Normal [3] spelling teen elements copy nahi karti aur count automatically saath nahi laati.
MisconceptionPaas mein memory hone se out-of-range subscript valid hai.
Access ko array bounds satisfy karne hote hain. Paas ka address ya successful run ek extra element nahi banata.
Thoda aur depth meinOptional technical detail
Operator ko dekhein
Yahan actual array par sizeof aur unary & usual array-to-pointer conversion apply nahi karte. &marks ka type pointer-to-array hai; p ke initializer mein marks se pointer-to-int milta hai.
Arrays of arrays mein row type bachta hai
int grid[2][3] ka usual conversion, 3 int ki row ke pointer mein hota hai. int ** nahi milta. Model mein row bounds aur pointed-to type ko saath rakhein.
C17 C17 mein array parameter adjustment aur one-past boundary apply hote hain. Variable-length arrays ke extra rules hain; yeh fixed-size example un par depend nahi karta.
C23 C23 ke typeof operators usual conversion ke bajay array type preserve kar sakte hain. Array parameters abhi bhi pointer parameters mein adjust hote hain; aise parameter par typeof ko adjusted type milta hai.
Yeh public committee drafts hain; clause references se explanation verify kar sakte hain. N3096 ek C23 working draft hai.
Apne words mein samjhayein
sizeof wala element-count formula yahan kyun kaam karta hai, pointer parameter par kyun nahi?
Ek explanation se compare karein
Yahan marks actual array hai. Pointer parameter ka type pointer hai, isliye sizeof caller ke array ke bajay us pointer ko measure karta hai.
Aage badhne se pehle
- Array ek type ke elements ki contiguous sequence rakhta hai.
- Valid indexes existing elements identify karte hain; one-past pointer boundary hai, element nahi.
- Count aur range information available storage se consistent honi chahiye.
In ideas ko alag rakhein
- Last element / One-past boundary
- n elements wale array ke indexes 0 se n−1 hain; n boundary ko element ki tarah dereference nahi kar sakte.
Element count aur largest valid index ka difference kaise explain karenge?
Optional: bolkar samjhein ya note rakhein. Tayyar hon toh aage badh sakte hain.Apni understanding check karein
Optional hai. Answers save ya send nahi hote; chapter kabhi lock nahi hota.
Har choice ki explanation padhein
- 3
Indices zero se shuru hote hain; index 3 teen elements ke bahar hai.
- Pehli stored value par depend karta hai.
Element values indexing range nahi badalti.
- 2
✓ Sahi reasoning. Element indices 0, 1 aur 2 hain.
C17
Earlier edition ka quick reference
Existing section links aur saved passages ke liye retained. Connected learning sequence ke liye upar expanded explanation padhein.
Arrays
Array same-typed elements ko contiguously store karta hai aur apni lifetime mein resize nahi hota. C subscripts automatically check nahi karti; valid elements ke bahar access undefined behavior hai. Multidimensional arrays row-major order use karte hain. C99 ne variable-length arrays (VLAs) add kiye; evaluated bounds positive hone chahiye aur evaluate hone ke baad us array instance ke liye fixed rehte hain. C11/C17 VLA aur variably modified type support omit kar sakte hain. C23 variably modified types ka support require karta hai, lekin automatic storage duration wale VLA objects ab bhi optional hain. Har compiler mein har form ka support assume na karein.
Strings
C string characters ki sequence hai jo null character ('\0') se end hoti hai; terminator ke bina char array string nahi hai. String literals ki static storage duration hoti hai; unhe modify karna undefined behavior hai, chahe physical memory read-only ho ya nahi. Read-only view ke liye const char *s = "hello";, writable copy ke liye char buf[] = "hello"; use karein. sizeof buf terminator include karta hai, strlen(buf) nahi.
Key <string.h> Functions
| Function | Purpose |
|---|---|
strlen |
String ki length, terminating \0 ko exclude karke |
strcpy / strncpy |
String copy karna |
strcat / strncat |
String append karna |
strcmp / strncmp |
Strings compare karna |
strchr / strstr |
Ek character / substring search karna |
strtok |
Delimiter characters se string ko tokenize karna |
memcpy / memmove |
Raw bytes copy karna (dusra overlapping regions ko safely handle karta hai) |
memset |
Memory ke block ko ek given byte value se fill karna |
memcmp |
Raw bytes compare karna |
Bounds actual destination capacity ke hisaab se hone chahiye. Source mein kam se kam n characters hon toh strncpy destination ko null terminator ke bina chhod sakta hai; yeh drop-in safe string-copy function nahi. strncat appended characters limit karta hai, total destination size nahi; existing string aur final null character ke liye bhi jagah chahiye. snprintf bounded formatted output de sakta hai, lekin errors/truncation ke liye return value check karein. memcpy ko non-overlapping regions chahiye; overlap ke liye memmove use karein. memcmp bytes compare karta hai, general C values nahi.
Agla idea padhne ke liye tayyar?
Mark this chapter as read whenever you feel ready.