This repository contains implementations of core algorithms and data structures in Java. It includes topics such as sorting, searching, recursion, dynamic programming, graph algorithms, greedy methods, hashing, trees, heaps, and more. The aim is to practice algorithm design, analyze complexities, and strengthen problem-solving skills for intervie

Which sorting algorithm grows faster with the time complex data size or the space complex grows faster. In this project, we compared the time and space complexities of counting_sort, heap_sort, quick_sort, insertion_sort and merge_sort algorithms.