The “Chunked Insertion Sort” algorithm is proposed as an innovative approach to enhance the efficiency of traditional sorting methods. It achieves improved sorting performance by partitioning the input array into smaller chunks and independently applying the Insertion Sort procedure to each chunk. The sorted chunks are then efficiently merged to obtain the final sorted array. Experimental analysis reveals that the Chunked Insertion Sort algorithm outperforms Quick, Merge, and Insertion Sort methods for small input sizes and partially ordered arrays. Its adaptability and simplicity make it a valuable addition to the sorting toolkit, offering an optimized alternative for specific data scenarios. This study offers significant findings regarding the algorithm's effectiveness, thereby enhancing the efficiency of array sorting approaches.