Skip to content

README.md

Latest commit

 

History

History
56 lines (41 loc) · 2 KB

README.md

File metadata and controls

56 lines (41 loc) · 2 KB

PYTHON DSA

██████╗ ██╗   ██╗████████╗██╗  ██╗ ██████╗ ███╗   ██╗
██╔══██╗╚██╗ ██╔╝╚══██╔══╝██║  ██║██╔═══██╗████╗  ██║
██████╔╝ ╚████╔╝    ██║   ███████║██║   ██║██╔██╗ ██║
██╔═══╝   ╚██╔╝     ██║   ██╔══██║██║   ██║██║╚██╗██║
██║        ██║      ██║   ██║  ██║╚██████╔╝██║ ╚████║
╚═╝        ╚═╝      ╚═╝   ╚═╝  ╚═╝ ╚═════╝ ╚═╝  ╚═══╝

This repository contains Python implementations of common data structures, algorithms, and small practice programs.

Contents

  • Array - array basics and index-based problems
  • divideAndConquer - divide and conquer examples
  • Graph - graph representation, BFS, and DFS
  • greedyAlgo - greedy algorithm problems
  • LinkedList - singly and doubly linked list implementations
  • Queue - simple, circular, and double-ended queues
  • recursion - recursive problems and examples
  • sort - sorting algorithms
  • Stack - stack implementation and examples
  • Tree - binary search tree and tree traversal

Files at Root

  • armstrong.py - Armstrong number check
  • poison.py - practice script
  • prc.py - practice script

How to Run

Use Python 3 to run any file directly:

python path/to/file.py

Examples:

python sort/quickSort.py
python Graph/BFS.py
python Tree/BST.py

Purpose

This repository is for learning, practice, and quick reference. The code is organized by topic so it is easy to find a specific algorithm or data structure.

Notes

  • File names are kept simple for quick study and testing.
  • Some files may be standalone practice programs rather than reusable modules.