This repository contains C programming practice files, logging daily coding tasks and fundamental computer science algorithms. The files cover core concepts such as sorting, searching, array indexing, and algorithm complexity analysis.
- Day 2: Basic C constructs, syntax structure, and array initialization.
- Day 3: Selection Sort algorithm design and implementation (includes step-by-step sorting logic for array values).
- Day 4: Iterative array logic, searching algorithms, and parameter passing.
- Day 5: Function structures, scope rules, and sorting optimization.
- Day 6: Intermediate algorithm exercises, memory utilization, and pointer arrays.
- Day 7: Multi-file concepts, complex sorting logic, and recursion analysis.
- Selection Sort: Simple sorting algorithm that repeatedly finds the minimum element and sorts in-place.
- Bubble Sort: Linear comparison sort.
- Linear & Binary Search: Array search methods.
To compile and run any C program file locally, use a compiler like gcc:
- Compile:
�ash gcc "C Program Day 3.txt" -o Day3 - Run:
�ash ./Day3
(Note: File extensions are currently saved as .txt or .md containing the code, which can be renamed to .c for direct compiler runs).
- Solidified understanding of static memory allocation, array sizing, and type declarations.
- Calculated time and space complexities (Big O notation) for Selection and Bubble sorting.
- Understood compiler stages and debugging processes.
Monica S.
- GitHub: @Monica-Sudhakar