https://github.com/dantethemartian/data-structures-and-algorithms

🧩 Data Structures and Algorithms

https://github.com/dantethemartian/data-structures-and-algorithms

Science Score: 13.0%

This score indicates how likely this project is to be science-related based on various indicators:

  • β—‹
    CITATION.cff file
  • βœ“
    codemeta.json file
    Found codemeta.json file
  • β—‹
    .zenodo.json file
  • β—‹
    DOI references
  • β—‹
    Academic publication links
  • β—‹
    Academic email domains
  • β—‹
    Institutional organization owner
  • β—‹
    JOSS paper metadata
  • β—‹
    Scientific vocabulary similarity
    Low similarity (5.6%) to scientific vocabulary
Last synced: 10 months ago · JSON representation

Repository

🧩 Data Structures and Algorithms

Basic Info
  • Host: GitHub
  • Owner: dantethemartian
  • License: mit
  • Language: Jupyter Notebook
  • Default Branch: main
  • Size: 112 KB
Statistics
  • Stars: 0
  • Watchers: 1
  • Forks: 0
  • Open Issues: 0
  • Releases: 0
Created almost 2 years ago · Last pushed over 1 year ago
Metadata Files
Readme License

README.md

🌲 Data Structures:

``` Linear: πŸ”΅ Arrays πŸ”΅ Linked Lists (Singly, Doubly, Circular) πŸ”΅ Stacks (LIFO) and Queues (FIFO)

Non-Linear:
🟒 Hash Maps & Tables
🟒 Graphs
🟒 Trees
🟒 Binary Trees & Binary Search Trees (BSTs)
🟒 Self-Balancing Trees (AVL, Red-Black, Splay)
🟒 Heaps

Special:
🟣 Tries
🟣 Segment Trees
🟣 Fenwick Trees (Binary Indexed Tree)
🟣 Disjoint Set Union (DSU)
🟣 Minimum Spanning Trees

```

♾️ Algorithms:

``` πŸ”΄ Divide & Conquer

Sorting Algorithms: 
🟠 Bubble Sort
🟠 Insertion Sort
🟠 Selection Sort
🟠 Counting Sort
🟠 Quick Sort
🟠 Merge Sort
🟠 Heap Sort
🟠 Radix Sort
🟠 Bucket Sort

Searching Algorithms: 
🟑 Linear Search
🟑 Binary Search

🟣 Sieve of Eratosthenes

πŸ”΄ Knuth-Morris-Pratt Algorithm

Greedy:
🟒 Max Number Non-Overlapping Intervals on Axis
🟒 Fractional Knapsack Problem

Dynamic Programming:
🟠 0-1 Knapsack Problem
🟠 Longest Common Subsequence
🟠 Longest Increasing Subsequence

πŸ”΅ Convex Hull

Graph Traversals: 
πŸ”΄ Bredth-First Search (BFS)
πŸ”΄ Depth-First Search (DFS)

Graph Algorithms:
🟑 Floyd-Warshall/Roy-Floyd Algorithm
🟑 Dijkstra's Algorithm & Bellman-Ford Algorithm

🟒 Topological Sorting ```

πŸͺͺ License

MIT License

Owner

  • Name: DantΓ©
  • Login: dantethemartian
  • Kind: user
  • Location: The Moon

πŸ’­ ML 🧠 AI πŸ—£οΈ NLP/LLMsπŸ”₯Deep Learning 🧩 Lin Alg 🧬 Langs πŸ‘“ Comp Vis πŸ‘€ New Experiences & Traveling 🎲 Solving Complex Probs

GitHub Events

Total
Last Year