C Notes
HubApplications of C Programming LanguageFeatures of C Programming LanguageHistory of C Programming LanguageWhat is C Language?Why Learn C Programming in 2024?First C Program - Hello World in C with ExplanationGCC Compiler - Complete Guide to GNU C CompilerInstall C Compiler on Linux - GCC Setup Guide for All DistrosInstall C Compiler on macOS - Xcode Command Line Tools and Homebrew GCCInstall C Compiler on Windows - MinGW, MSYS2, and WSL GuideSetup VS Code for C Programming - Complete Configuration GuideC Syntax Rules — Complete GuideComments in C ProgrammingConstants in C ProgrammingData Types in CIdentifiers in C ProgrammingKeywords in C ProgrammingStructure of a C ProgramVariables in C ProgrammingArithmetic Operators in C ProgrammingAssignment Operators in C ProgrammingBitwise Operators in C ProgrammingIncrement and Decrement Operators in CLogical Operators in C ProgrammingRelational Operators in C ProgrammingTernary Operator in C ProgrammingBreak Statement in C ProgrammingContinue Statement in C ProgrammingDo-While Loop in C ProgrammingFor Loop in C ProgrammingGoto Statement in C Programmingif-else Statement in C Programmingif Statement in C ProgrammingNested if Statements in C ProgrammingSwitch Statement in C ProgrammingWhile Loop in C ProgrammingFunction Arguments in C - Pass by Value vs Pass by ReferenceFunction Call in C ProgrammingFunction Declaration (Prototype) in CFunction Definition in C ProgrammingIntroduction to Functions in C ProgrammingRecursion in C ProgrammingReturn Statement in C ProgrammingStorage Classes in C ProgrammingArray Operations in C - Searching, Sorting, Insert and DeleteArray Programs in C - Reverse, Rotate, Duplicates, MergeIntroduction to Arrays in C ProgrammingMultidimensional Arrays in C ProgrammingOne Dimensional Arrays in C ProgrammingPassing Arrays to Functions in CTwo Dimensional Arrays in C ProgrammingString Comparison in C - strcmp, strncmp, Case-InsensitiveString Functions in C - strlen, strcpy, strcat, strcmpC String Handling Library - Complete string.h ReferenceString Manipulation in C - Reverse, Uppercase, PalindromeString Programs in C - Anagram, Word Count, Vowels, FrequencyStrings in C Programming - Complete IntroductionDouble Pointers in C - Pointer to PointerPointer Arithmetic in C ProgrammingPointer Declaration and Initialization in CPointer Programs in C - Swap, String Reversal, Dynamic AllocationPointers and Arrays in C - The Relationship ExplainedPointers and Functions in C - Pass by ReferenceIntroduction to Pointers in C ProgrammingVoid Pointers in C - Generic Pointers Guidecalloc() in C – Contiguous Memory AllocationDynamic Arrays in C – Runtime-Sized Arraysfree() in C – Releasing Dynamic Memorymalloc() in C – Dynamic Memory AllocationMemory Management Best Practices in Crealloc() in C – Resizing Dynamic MemoryBinary Files in C – fread and fwriteFile Handling in C – IntroductionFile Handling Projects in C – Student Records & Phone BookFile Modes in C – Complete Guidefopen() and fclose() in C – Opening and Closing FilesReading Files in C – fgetc, fgets, fscanf, freadWriting Files in C – fputc, fputs, fprintf, fwriteConditional Compilation in C – #ifdef, #ifndef, #if#define Macros in C – Constants and Macro FunctionsHeader Files in C – Creating Custom Headers#include Directive in C – File InclusionMacro Functions in C – Parameterized MacrosC Preprocessor – Overview and DirectivesGraphs in C – Adjacency Matrix, Adjacency List, BFS, and DFSHash Tables in C – Implementation, Collision Handling, and ChainingLinked List in C – Singly, Doubly, and Circular with ImplementationQueue in C – Linear, Circular, and Priority Queue ImplementationStack in C – Array and Linked List Implementation with ApplicationsTrees in C – Binary Search Tree Implementation with TraversalsC Programming Best Practices – Coding Standards, Safety, and PerformanceBit Fields in C – Definition, Use Cases, and Protocol HeadersC Standard Library Overview – All Headers and Common FunctionsCommand Line Arguments in C – argc and argv ExplainedDebugging Techniques in C – GDB, Valgrind, and SanitizersFunction Pointers in C – Complete Guide with ExamplesMemory Layout of a C Program – Text, Data, BSS, Heap, StackBank Management System in C – Complete Project with File StorageFile Encryption Tool in C – XOR Cipher ImplementationLibrary Management System in C – Complete Project with Source CodeMini Compiler in C – Lexer and Parser for Simple ExpressionsSnake Game in C – Console-Based Game with Source CodeStudent Management System in C – Complete Project with Source CodeC Programming Cheatsheet – Complete Quick Reference GuideTop 50 C Programming Interview Questions with Answers (2025)Memory Management Interview Questions in C with AnswersOutput Prediction Questions in C – What Will This Program Print?Pointer Interview Questions in C – Tricky Problems with AnswersCommon C Programming Errors and Solutions – Debugging GuideImportant C Programs – 50+ Frequently Asked Programs with SolutionsQuick Revision Notes for C Programming – Complete C in 10 MinutesRecommended C Programming Books – From Beginner to ExpertFormat Specifiers in C - Complete Referencegetchar() and putchar() in C Programminggets() and puts() in C ProgrammingC Input Output Programs and Examplesprintf() Function in C Programmingscanf() Function in C ProgrammingArrays of Structures in C – Managing CollectionsEnums in C – Enumerated Data TypesNested Structures in C – Struct Within StructPointers to Structures in C – Arrow OperatorStructures in C – User-Defined Data Typestypedef in C – Creating Type AliasesUnions in C – Shared Memory Data Types
Master one-dimensional arrays in C with detailed examples covering declaration, initialization, traversal, input/output operations, and common array algorithms.
A one-dimensional array is the simplest form of an array — a linear sequence of elements stored in contiguous memory locations. Think of it like a row of numbered boxes, where each box holds a value and can be accessed instantly using its position number (index).
In most real-world C programs, 1D arrays are the backbone for handling collections of data — whether it's storing sensor readings, managing a list of scores, or buffering input characters.
Declaration and Memory Allocation
When you declare a 1D array, you're asking the compiler to reserve a continuous block of memory:
Example
int numbers[5]; // Reserves 5 × 4 = 20 bytes (assuming 4-byte int)
| numbers | numbers | numbers | numbers | numbers |
|---|---|---|---|---|
| [0] | [1] | [2] | [3] | [4] |
| garbage | garbage | garbage | garbage | garbage |
Notice that without initialization, local arrays contain unpredictable garbage values.
Initialization Techniques
At Declaration Time
Example
int primes[5] = {2, 3, 5, 7, 11}; // Full initialization
int partial[5] = {10, 20}; // Remaining become 0
int auto_size[] = {1, 2, 3, 4, 5, 6}; // Size = 6 (compiler infers)
int zeros[100] = {0}; // All 100 elements = 0
Runtime Initialization Using Loops
Example
#include <stdio.h>
int main() {
int arr[10];
// Initialize with squares of index
for (int i = 0; i < 10; i++) {
arr[i] = i * i;
}
// Display
for (int i = 0; i < 10; i++) {
printf("arr[%d] = %d\n", i, arr[i]);
}
return 0;
}
Output
arr[0] = 0 arr[1] = 1 arr[2] = 4 arr[3] = 9 arr[4] = 16 arr[5] = 25 arr[6] = 36 arr[7] = 49 arr[8] = 64 arr[9] = 81
Reading Array Elements from User
Example
#include <stdio.h>
int main() {
int n;
printf("How many elements? ");
scanf("%d", &n);
int arr[n];
printf("Enter %d integers:\n", n);
for (int i = 0; i < n; i++) {
printf(" Element %d: ", i + 1);
scanf("%d", &arr[i]);
}
printf("\nYou entered: ");
for (int i = 0; i < n; i++) {
printf("%d ", arr[i]);
}
printf("\n");
return 0;
}
Output
How many elements? 5 Enter 5 integers: Element 1: 45 Element 2: 12 Element 3: 78 Element 4: 34 Element 5: 56 You entered: 45 12 78 34 56
Array Traversal Patterns
Traversal means visiting each element of the array exactly once. Here are common patterns:
Forward Traversal
Example
for (int i = 0; i < n; i++) {
printf("%d ", arr[i]);
}
Reverse Traversal
Example
for (int i = n - 1; i >= 0; i--) {
printf("%d ", arr[i]);
}
Step Traversal (Every Other Element)
Example
for (int i = 0; i < n; i += 2) {
printf("%d ", arr[i]); // Prints elements at even indices
}
Common Operations on 1D Arrays
Finding the Sum and Average
Example
#include <stdio.h>
int main() {
int arr[] = {23, 45, 12, 67, 89, 34};
int n = sizeof(arr) / sizeof(arr[0]);
int sum = 0;
for (int i = 0; i < n; i++) {
sum += arr[i];
}
float average = (float)sum / n;
printf("Sum = %d\n", sum);
printf("Average = %.2f\n", average);
return 0;
}
Output
Sum = 270 Average = 45.00
Finding Maximum and Minimum
Example
#include <stdio.h>
int main() {
int arr[] = {23, 45, 12, 67, 89, 34};
int n = sizeof(arr) / sizeof(arr[0]);
int max = arr[0], min = arr[0];
int maxIndex = 0, minIndex = 0;
for (int i = 1; i < n; i++) {
if (arr[i] > max) {
max = arr[i];
maxIndex = i;
}
if (arr[i] < min) {
min = arr[i];
minIndex = i;
}
}
printf("Maximum: %d at index %d\n", max, maxIndex);
printf("Minimum: %d at index %d\n", min, minIndex);
return 0;
}
Output
Maximum: 89 at index 4 Minimum: 12 at index 2
Counting Occurrences of an Element
Example
#include <stdio.h>
int main() {
int arr[] = {5, 3, 7, 3, 8, 3, 1, 9, 3};
int n = sizeof(arr) / sizeof(arr[0]);
int target = 3, count = 0;
for (int i = 0; i < n; i++) {
if (arr[i] == target) {
count++;
}
}
printf("%d appears %d times in the array\n", target, count);
return 0;
}
Output
3 appears 4 times in the array
Copying One Array to Another
Since you cannot directly assign one array to another using =, you must copy element by element:
Example
#include <stdio.h>
int main() {
int source[] = {10, 20, 30, 40, 50};
int n = sizeof(source) / sizeof(source[0]);
int dest[n];
// Copy elements
for (int i = 0; i < n; i++) {
dest[i] = source[i];
}
// Verify
printf("Source: ");
for (int i = 0; i < n; i++) printf("%d ", source[i]);
printf("\nDest: ");
for (int i = 0; i < n; i++) printf("%d ", dest[i]);
printf("\n");
return 0;
}
Output
Source: 10 20 30 40 50 Dest: 10 20 30 40 50
Size Calculation Using sizeof
A very important technique — calculating array length at compile time:
Example
int arr[] = {10, 20, 30, 40, 50};
int length = sizeof(arr) / sizeof(arr[0]); // 20 / 4 = 5
Warning: This technique only works when the array is in the same scope as thesizeofcall. Once an array is passed to a function, it decays to a pointer, andsizeofreturns the pointer size instead.
Array Bounds and Safety
C trusts the programmer completely — it performs no bounds checking:
Example
int arr[5] = {1, 2, 3, 4, 5};
// These are DANGEROUS — undefined behavior!
arr[5] = 99; // Writing beyond array bounds
int x = arr[-1]; // Negative index — accessing memory before array
This is both a strength (performance) and a weakness (security vulnerabilities like buffer overflows).
Practical Example: Frequency Counter
Example
#include <stdio.h>
int main() {
int arr[] = {1, 2, 3, 2, 1, 3, 3, 4, 5, 4};
int n = sizeof(arr) / sizeof(arr[0]);
int freq[6] = {0}; // Assuming values are 1-5
for (int i = 0; i < n; i++) {
freq[arr[i]]++;
}
printf("Element | Frequency\n");
printf("--------|----------\n");
for (int i = 1; i <= 5; i++) {
printf(" %d | %d\n", i, freq[i]);
}
return 0;
}
Output
Element | Frequency --------|---------- 1 | 2 2 | 2 3 | 3 4 | 2 5 | 1
Interview Questions
Q1: What is the time complexity of accessing an element in a 1D array?
O(1) — constant time. Since elements are stored contiguously and each has a fixed size, the address of any element can be computed directly using the formula: base_address + index × sizeof(element).
Q2: How do you find the size of an array without using sizeof?
You can use pointer arithmetic: int size = *(&arr + 1) - arr;. Here, &arr + 1 points to the memory location right after the last element of the array.
Q3: What's the difference between int arr[5] = {0} and memset(arr, 0, sizeof(arr))?
Both zero-out the array. The initializer syntax works only at declaration time, while memset can be used anywhere. However, memset sets bytes to 0, which works for integers but not for setting all elements to a non-zero value (except -1 due to two's complement representation).
Q4: Can you declare an array of size 0 in C?
In standard C, zero-length arrays are not allowed. However, GCC supports them as an extension, primarily used as flexible array members at the end of structures.
Summary
- A 1D array is a linear collection of same-type elements in contiguous memory
- Elements are accessed using zero-based indexing with O(1) time complexity
- Always track array size separately — C arrays don't store their own length
- Use
sizeof(arr)/sizeof(arr[0])to calculate length (only works in the declaring scope) - Common operations include traversal, searching, finding min/max, and copying
- C performs no bounds checking — buffer overflows are the programmer's responsibility
Exam Focus
Revise definitions, diagrams, examples, and short-answer points for One Dimensional Arrays in C Programming.
Interview Use
Prepare one clear explanation, one practical example, and one common mistake for this C Programming topic.
Search Terms
c-programming, c programming, programming, arrays, one, dimensional, one dimensional arrays in c programming
Related C Programming Topics
Continue learning this concept
ArraysTwo Dimensional Arrays in C ProgrammingComplete guide to 2D arrays in C including declaration, initialization, matrix operations, row-column access patterns, and practical examples with memory diagrams.ArraysArray Operations in C - Searching, Sorting, Insert and DeleteLearn essential array operations in C including linear search, binary search, bubble sort, selection sort, insertion, and deletion with step-by-step examples.ArraysArray Programs in C - Reverse, Rotate, Duplicates, MergePractice essential array programs in C including reversing arrays, rotating elements, finding duplicates, merging sorted arrays, and more coding problems with solutions.ArraysIntroduction to Arrays in C ProgrammingLearn what arrays are in C, why we need them, how to declare and initialize arrays, and understand memory layout with practical examples.ArraysMultidimensional Arrays in C ProgrammingLearn about multidimensional arrays (3D and beyond) in C programming with practical examples, memory layout explanations, and real-world use cases.ArraysPassing Arrays to Functions in CUnderstand how arrays are passed to functions in C, array decay to pointers, why size information is lost, and best practices for writing array-handling functions.