v1.0.1

• Remove logo, rename to just "algorithms"
• Add usage section to modal dialog (pip install, import, example call)
• Fix doctest continuation line parsing
• Hide unhelpful mechanism/usage for re-export files

v1.0.0 — Restructured for Education

What's New

Complete repository restructuring for educational clarity:

• data_structures/ — all core data structures (AVL, B-tree, BST, heap, trie, union-find, etc.) in one package
• Consistent naming — sorting/, searching/, dynamic_programming/, math/, linked_list/, queue/
• BFS/DFS merged into graph/ — traversal techniques, not separate categories
• Tree subdirectories flattened — all tree algorithms at tree/ top level
• Full ruff compliance — strict rules ["E", "W", "F", "I", "N", "UP", "B", "SIM"] across 300+ files
• 415 tests passing on Python 3.10–3.13
• README rewritten with descriptions for every algorithm and usage examples

Breaking Changes

This is a major version bump (0.2.0 → 1.0.0) due to package restructuring:

• algorithms.sort → algorithms.sorting
• algorithms.search → algorithms.searching
• algorithms.dp → algorithms.dynamic_programming
• algorithms.maths → algorithms.math
• algorithms.linkedlist → algorithms.linked_list
• algorithms.queues → algorithms.queue
• algorithms.bfs / algorithms.dfs → algorithms.graph
• algorithms.unionfind → algorithms.data_structures.union_find
• Data structures (stack, queue, heap, hashtable, linked list) moved to algorithms.data_structures

v0.1.4

update and release v0.1.4 to PyPI