blackjack-algos 1.1.0

Sorting (iterative+recursive), graph algorithms (BFS/DFS/Dijkstra/Bellman-Ford/Floyd-Warshall), Queue & LinkedList with interactive CLI

blackjack

A comprehensive Python library for sorting and graph algorithms.

Features

• Sorting Algorithms: Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, Heap Sort.
• Graph Algorithms: Breadth-First Search (BFS), Depth-First Search (DFS).

Installation

pip install blackjack

Usage

As a Library

from blackjack import quick_sort, bfs

# Sort a list
arr = [64, 34, 25, 12, 22, 11, 90]
sorted_arr = quick_sort(arr)
print(sorted_arr)

# BFS on a graph
graph = {
    'A': ['B', 'C'],
    'B': ['D'],
    'C': ['E'],
    'D': [],
    'E': []
}
print(bfs(graph, 'A'))

As a CLI tool

blackjack quick_sort
blackjack bfs

License

MIT