Metadata-Version: 2.1
Name: hammuon
Version: 0.1.10
Summary: Basic and important data structures algorithms.
Home-page: https://github.com/mcvarer/algorithms
License: GNU General Public License
Author: mcvarer
Author-email: ktuce.mcanv@gmail.com
Requires-Python: >=3.9,<4.0
Classifier: License :: Other/Proprietary License
Classifier: Programming Language :: Python :: 3
Classifier: Programming Language :: Python :: 3.10
Classifier: Programming Language :: Python :: 3.9
Project-URL: Repository, https://github.com/mcvarer/algorithms
Description-Content-Type: text/markdown

# Basic Data Strcutre Algorithms

## Installing

```bash
pip install hammuon
```


## 1. Quick Sort
Quick Sort is a sorting algorithm, which is commonly used in computer science. 
Quick Sort is a divide and conquer algorithm. 

### Usage
```python
from hammuon.data_structure.quick_sort import quickSort

print(quickSort([8, 12, 55, -12]))
```

### Output
```bash
[-12, 8, 12, 55]
```

## 2. Bubble Sort
Bubble sort is a sorting algorithm that compares two adjacent
elements and swaps them until they are not in the intended order.

### Usage
```python
from hammuon.data_structure.bubble_sort import bubbleSort

print(bubbleSort([8, 12, 55, -12]))
```

### Output
```bash
[-12, 8, 12, 55]
```

## 3. Selection Sort
Selection sort is a simple sorting algorithm.

### Usage
```python
from hammuon.data_structure.selection_sort import selectionSort

print(selectionSort([8, 12, 55, -12]))
```

### Output
```bash
[-12, 8, 12, 55]
```
