You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
An optimised 🚀 implementation of Data structures & Algorithms like Fenwick Trees, Segment Trees, Stacks, Priority Queues, Linked Lists etc for enterprise usage in our favourite ❤️ language - JavaScript
The project is a network model of priority based packet routing implemented using the priority queue using max heap data structure. The project mimics packet routing, by receiving network packets (file handling concept) and re-transmitting the packets based on network priority.
Have a warehouse that is made up of an array of sector objects, with each sector represented by a min binary priority queue based on the last day the products were purchased. Implemented a method that adds products into its proper sector which is dependent on their id, a restock/purchase method that increases/decreases the number of items