Data Structures package for Problem Solving with Algorithms and Data Structures using Python
Project description
# pythonds3 Data Structures package for Problem Solving with Algorithms and Data Structures using Python by Brad Miller and David Ranum.
The package is a supplement to [Problem Solving with Algorithms and Data Structures using Python](https://runestone.academy/runestone/static/pythonds/index.html). It contains implementations of basic data structures, searching and sorting algorithms, trees, and graphs. Some implementation details are intentionally left out and readers are encouraged to complete them on their own.
- ## Object-oriented programming
Typical class implementation
Use of getters, setters, and properties
Overriding magic methods (len, str, contains etc)
- ## Basic data structures
Stack
Queue
Deque
Ordered linked list
Unordered linked list
- ## Searching
Hash Table
- ## Sorting
Bubble sort
Selection sort
Insertion sort
Shellsort
Merge sort
Quicksort
Heapsort
- ## Trees
Binary tree
Binary search tree
AVL tree
Binary heap
Priority queue
- ## Graphs
Breadth first search
Depth first search
Dijkstra’s shortest path algorithm
Bellman-Ford shortest path algorithm
Prim’s spanning tree algorithm
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for pythonds3-3.0.2-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 6e9d48dd0846a826057067b1e0725e0e3fd97b3090d9353f1740bc832487ce1d |
|
MD5 | beec797b1dc976b15004361ac71cf470 |
|
BLAKE2b-256 | c14ebb933ae8639d78af4a37ceb63e176c198370beff14f8174b3e92752d4e6d |