Analyzed the efficiency of five Java sorting algorithms (Bubble, Insertion, Merge, Quick, Radix) using Big O notation. Benchmarked performance via significant operation counts and the Java Microbenchmarking Harness (JMH) to ensure consistent, isolated results. Includes data visualizations of time complexity.