Basic and important data structures algorithms.
Project description
Basic Algorithms
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
from data_structure import quickSort
print(quickSort([8, 12, 55, -12]))
Output
[-12, 8, 12, 55]
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
hammuon-0.1.4.tar.gz
(1.6 kB
view hashes)