References & Resources¶

The following academic and technical sources supported the algorithm analysis, implementation decisions, and theoretical validation of this project.

Academic Textbooks¶

Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2022).
Introduction to Algorithms (4th ed.). MIT Press.
Comprehensive reference for sorting algorithms, asymptotic analysis, and Big-O notation.
Weiss, M. A. (2014).
Data Structures and Algorithm Analysis in Java (3rd ed.). Pearson Education.
Detailed discussion of Linked Lists and sorting implementations in Java.
Sedgewick, R., & Wayne, K. (2011).
Algorithms (4th ed.). Addison-Wesley.
Provides mathematical foundations and visual explanations of sorting algorithms.

GeeksforGeeks. (n.d.).
Sorting Algorithms – Complete Guide.
Retrieved October 2025 from:
https://www.geeksforgeeks.org/sorting-algorithms/
Practical examples and complexity breakdowns.
TutorialsPoint. (n.d.).
Data Structures and Algorithms – Sorting Techniques.
Retrieved October 2025 from:
https://www.tutorialspoint.com/data_structures_algorithms/sorting_algorithms.htm
Algorithm overviews and pseudocode explanations.

Alomran, S., & Bindayel, L. (2025).
CS210 Project – Linked List Implementation and Runtime Analysis
[Computer software]. GitHub.

Repository:
https://github.com/Shoug-Alomran/CS210-Project-Linked-List-Implementation-and-Runtime-Analysis