https://github.com/aliiimaher/lazy-hungry-potato

"Data Structures & Algorithms" course project, Fall 2022.
https://github.com/aliiimaher/lazy-hungry-potato

data-structures data-structures-and-algorithms heap heap-sort trie-tree

Last synced: about 6 hours ago
JSON representation

"Data Structures & Algorithms" course project, Fall 2022.

• Host: GitHub
• URL: https://github.com/aliiimaher/lazy-hungry-potato
• Owner: aliiimaher
• License: mit
• Created: 2023-01-31T20:15:09.000Z (almost 2 years ago)
• Default Branch: main
• Last Pushed: 2023-01-31T21:05:06.000Z (almost 2 years ago)
• Last Synced: 2024-11-13T20:41:53.791Z (2 months ago)
• Topics: data-structures, data-structures-and-algorithms, heap, heap-sort, trie-tree
• Language: Java
• Homepage:
• Size: 835 KB
• Stars: 8
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Lazy-Hungry-Potato

"Data Structures & Algorithms" course project, Fall 2022.

### This project is written in java.

------

The thecnique which I used for handling this project is as below:

We need a min-heap for sorting all the restaurants that the user gave us input. Then when we call the queries,  in addition to removing them from the heap and putting the n-called restaurant to a trie-tree, we also need to put them into a stack to protect the order of the algorithm we used.

**Note that removing from the min-heap is by calling the min-heapify function.**