A comprehensive collection of fundamental sorting algorithms implemented in Python. This repository provides clean, readable, and educational implementations of various sorting techniques to help developers understand data structures and algorithmic efficiency.

• About the Project
• Implemented Algorithms
• Getting Started
• License
• Acknowledgments

Sorting is a fundamental concept in computer science. This project serves as a practical guide to implementing classic sorting algorithms in Python. Originally conceived in 2022 and refined for professional standards in 2026, it offers a hands-on approach to learning how arrays are manipulated and organized.

The following sorting methods are currently available:

1. Bubble Sort: A simple comparison-based algorithm that repeatedly steps through the list.
2. Insertion Sort: Builds the final sorted array one item at a time.
3. Merge Sort: An efficient, stable, divide-and-conquer algorithm.
4. Selection Sort: An in-place comparison sorting algorithm that divides the input into two parts: sorted and unsorted.

• Python 3.x installed on your machine.

1. Clone the repository:

   git clone https://github.com/rajjitlai/python-sorting-methods-array.git

2. Navigate to the desired algorithm directory:

   cd bubble-sort

3. Run the script:

   python bubSort.py

Distributed under the MIT License. See LICENSE for more information.

Copyright © 2026 Rajjit Laishram. All rights reserved. Originally created in 2022.

• Inspired by classic computer science curricula.
• Developed for educational purposes and algorithmic exploration.

Made with ❤️ for the Developer Community