https://github.com/kazimovzaman2/holbertonschool-sorting_algorithms

Elchin Jafarli and Zaman Kazimov collaborate on implementing sorting algorithms with a focus on code quality, efficiency, and adherence to the Betty style.
https://github.com/kazimovzaman2/holbertonschool-sorting_algorithms

bubble-sort c-programming-language insertion-sort quick-sort selection-sort sorting-algorithms

Last synced: about 10 hours ago
JSON representation

Elchin Jafarli and Zaman Kazimov collaborate on implementing sorting algorithms with a focus on code quality, efficiency, and adherence to the Betty style.

• Host: GitHub
• URL: https://github.com/kazimovzaman2/holbertonschool-sorting_algorithms
• Owner: kazimovzaman2
• License: gpl-3.0
• Created: 2024-01-15T07:34:02.000Z (8 months ago)
• Default Branch: master
• Last Pushed: 2024-01-18T07:00:09.000Z (8 months ago)
• Last Synced: 2024-01-18T11:18:29.812Z (8 months ago)
• Topics: bubble-sort, c-programming-language, insertion-sort, quick-sort, selection-sort, sorting-algorithms
• Language: C
• Homepage:
• Size: 43 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Sorting Algorithms Implementation

[![License: GPL-3.0](https://img.shields.io/badge/License-GPL%203.0-blue.svg)](https://opensource.org/licenses/GPL-3.0)

[![GitHub stars](https://img.shields.io/github/stars/kazimovzaman2/holbertonschool-sorting_algorithms.svg?style=social)](https://github.com/kazimovzaman2/holbertonschool-sorting_algorithms/stargazers)

This repository contains implementations of various sorting algorithms in the C programming language. The algorithms are implemented with a focus on code quality, efficiency, and adherence to the Betty style.

## Table of Contents

- [Introduction](#introduction)

- [Algorithms](#algorithms)

- [Folder Structure](#folder-structure)

- [Usage](#usage)

- [Contributing](#contributing)

- [License](#license)

## Introduction

Elchin Jafarli and Zaman Kazimov collaborate on implementing sorting algorithms with the goal of providing clear, efficient, and well-documented code. The project is part of the Holberton School curriculum.

## Algorithms

1. **Bubble Sort:** [0-bubble_sort.c](0-bubble_sort.c) - Implements the bubble sort algorithm.

2. **Insertion Sort:** [1-insertion_sort_list.c](1-insertion_sort_list.c) - Implements the insertion sort algorithm.

3. **Selection Sort:** [2-selection_sort.c](2-selection_sort.c) - Implements the selection sort algorithm.

4. **Quick Sort:** [3-quick_sort.c](3-quick_sort.c) - Implements the quick sort algorithm.

- [sort.h](sort.h) - Header file with function prototypes and struct definitions.

## Folder Structure

- `0-O`: Contains information about the Big O notation and improvements for the bubble sort algorithm.

- `1-O`: Focuses on the Big O notation of the sorting algorithms.

- `2-O`: Correction and improvements in the Big O implementation.

- `LICENSE`: GPL-3.0 license file.

- `README.md`: Project documentation.

- `print_array.c` and `print_list.c`: Helper functions for printing arrays and linked lists.

## Usage

To use these sorting algorithms, you can include the respective C files in your project and call the appropriate functions. Make sure to follow the included header file for function prototypes.

## Contributing

If you'd like to contribute to the project, feel free to fork the repository and submit pull requests. Ensure that your code follows the Betty style guidelines.

## License

This project is licensed under the [GNU General Public License v3.0](LICENSE) - see the [LICENSE](LICENSE) file for details.

---

Feel free to modify and expand this README to better fit the specifics of your project. Good luck with your sorting algorithms implementation!