https://github.com/raven-s-soul/data-structures-and-algorithms

Quick notes for Trees, Hash, Graphs and Algorithms 2023/2024 at Roma 3
https://github.com/raven-s-soul/data-structures-and-algorithms

c complexity graphs hash hashtable heap queue sorting-algorithms stack trees university

Last synced: about 1 month ago
JSON representation

Quick notes for Trees, Hash, Graphs and Algorithms 2023/2024 at Roma 3

• Host: GitHub
• URL: https://github.com/raven-s-soul/data-structures-and-algorithms
• Owner: Raven-s-Soul
• License: mit
• Created: 2023-11-07T15:17:46.000Z (about 1 year ago)
• Default Branch: main
• Last Pushed: 2024-11-04T11:24:32.000Z (about 2 months ago)
• Last Synced: 2024-11-04T12:19:40.040Z (about 2 months ago)
• Topics: c, complexity, graphs, hash, hashtable, heap, queue, sorting-algorithms, stack, trees, university
• Homepage:
• Size: 156 KB
• Stars: 1
• Watchers: 0
• Forks: 2
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Data-Structures-and-Algorithms [Roma3](https://www.uniroma3.it)

 - [English](./README.md)

 - [IT-Italiano](./[IT]README.md)

## [Lists and Time Complexity](Lists/Lists.md)

> [!TIP]

> Is the base needed, a strong understanding, like after IT-Fundamentals:

> - [Random Access Machine](Lists/Lists.md#ram---random-access-machine)

> - [Pointers](Lists/Lists.md#Pointers)

> - [Struct/ADT](Lists/Lists.md#structs-or-adtabstract-data-type)

> - [Stack](Lists/Lists.md#pile-or-stack-)

> - [Queue](Lists/Lists.md#code-or-queue)

> - [Complexity](Lists/Lists.md#complexity)

## [Trees](Trees/Trees.md)

> [!IMPORTANT]

>  Focus, they look the same but they aren't:  

> - [Binary](Trees/Trees.md#binary)

> - [Searching](Trees/Trees.md#searching)

> - [Arbitrary Grade](Trees/Trees.md#arbitrary-grade)

> - [Black&Red](Trees/Trees.md#blackred)

> - [Priority Queue and Heap](Trees/Trees.md#priority-queue-and-heap)

## [Hash](Hash/Hash.md)

> [!WARNING]

> It's mostly theory, so at least you should be able to understand what it is and how it works.

> - [Hash Table](Hash/Hash.md#hash-tables)

> - [Equal](Hash/Hash.md#equal-functions)

> - [Hash Function](Hash/Hash.md#hash-functions) (Hash functions for differents data type are not included)

> - [Solution to collisions](Hash/Hash.md#solution-to-collisions)

## [Graphs](Graphs/Graphs.md)

> [!NOTE]

> The last step, you're so close!

> - [Lists](Graphs/Graphs.md#gaph-lists)

> - [Matrix](Graphs/Graphs.md#gaph-matrix)

> - [Objects](Graphs/Graphs.md#gaph-objects)

## [Sorting Algorithms](SortingAlgorithms/SortingAlgorithms.md)

> [!CAUTION]

> They are just hard to remember. It's literally theory so ***Hold still!***

> - [Properties](SortingAlgorithms/SortingAlgorithms.md#greedy)

> - [Master Theorem](SortingAlgorithms/SortingAlgorithms.md#master-theorem)

> - [Selection sort](SortingAlgorithms/SortingAlgorithms.md#selection-sort)

> - [Insertion sort](SortingAlgorithms/SortingAlgorithms.md#insertion-sort)

> - [Merge Sort](SortingAlgorithms/SortingAlgorithms.md#merge-sort)

> - [Quick Sort](SortingAlgorithms/SortingAlgorithms.md#quick-sort)

> - [Heap Sort](SortingAlgorithms/SortingAlgorithms.md#heap-sort)

> - [Tree Sort](SortingAlgorithms/SortingAlgorithms.md#tree-sort)

> - [Linear sorts](SortingAlgorithms/SortingAlgorithms.md#counting-sort)

## [Problems Complexity](ProblemsComplexity/ProblemsComplexity.md#problems-complexity)

> It's just ***"Trivial Shit"***.

## We ***wish you luck*** for the exam! - **By every [contributors](Contributors/Contributors.md#contributors)**

> If you wanna do some improvements, "***fork***" the repository, do your edits, commit and push and then pull request.

> 

> Remember to add yourself at the end of contributors file.

> 

> If needed, feel free to email or contact.