Efficient Large-Scale Data Processing in C: An Experimental Study of Algorithmic and Memory Performance

Efficient processing of large-scale datasets requires careful consideration of algorithmic efficiency, execution time, and memory utilisation as data volume increases. This study experimentally evaluates four classical sorting algorithms—Quick Sort, Merge Sort, Heap Sort, and Insertion Sort—implemented in the C programming language. The algorithms are examined across increasing dataset sizes and four input patterns: random, sorted, reverse-sorted, and nearly sorted data. A controlled experimental framework is used to compare execution time, memory consumption, throughput, scalability, and time–memory trade-offs under consistent implementation and measurement conditions. The results demonstrate clear differences in performance as dataset size and input organisation change. Quick Sort provides the strongest speed-oriented performance under random input, while Merge Sort exhibits higher memory requirements because of its auxiliary storage. Heap Sort maintains low additional-memory requirements but generally requires more execution time than Quick Sort. Insertion Sort performs efficiently on ordered data but becomes increasingly costly as dataset size increases under disordered input. The findings demonstrate that practical algorithm selection should consider execution time, memory requirements, throughput, scalability, and workload characteristics rather than relying on execution time alone.

Authors

Publication Details

Journal
International journal of research and scientific innovation
Published
2026-11-16
DOI
https://doi.org/10.51244/ijrsi.2026.1310000207
Primary Topic
Algorithms and Data Compression
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Efficient Large-Scale Data Processing in C: An Experimental Study of Algorithmic and Memory Performance

Shubham Alria
2 links
International journal of research and scientific innovation
Algorithms and Data Compression
article

Efficient Large-Scale Data Processing in C: An Experimental Study of Algorithmic and Memory Performance

Shubham Alria
article en

Abstract

Efficient processing of large-scale datasets requires careful consideration of algorithmic efficiency, execution time, and memory utilisation as data volume increases. This study experimentally evaluates four classical sorting algorithms—Quick Sort, Merge Sort, Heap Sort, and Insertion Sort—implemented in the C programming language. The algorithms are examined across increasing dataset sizes and four input patterns: random, sorted, reverse-sorted, and nearly sorted data. A controlled experimental framework is used to compare execution time, memory consumption, throughput, scalability, and time–memory trade-offs under consistent implementation and measurement conditions. The results demonstrate clear differences in performance as dataset size and input organisation change. Quick Sort provides the strongest speed-oriented performance under random input, while Merge Sort exhibits higher memory requirements because of its auxiliary storage. Heap Sort maintains low additional-memory requirements but generally requires more execution time than Quick Sort. Insertion Sort performs efficiently on ordered data but becomes increasingly costly as dataset size increases under disordered input. The findings demonstrate that practical algorithm selection should consider execution time, memory requirements, throughput, scalability, and workload characteristics rather than relying on execution time alone.

International journal of research and scientific innovationVol. 13(10)
Algorithms and Data Compression
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon