search

TheAlgorithms / C-Plus-Plus

Collection of various algorithms in mathematics, machine learning, computer science and physics implemented in C++ for educational purposes.
https://thealgorithms.github.io/C-Plus-Plus
MIT License
30.03k stars 7.1k forks source link

Implementing Priority Queue #2629

Closed AbhirajBose closed 10 months ago

AbhirajBose commented 10 months ago

Detailed description

In this issue,I will be adding the code of how a priority queue can be implemented. A priority queue is a type of queue which arranges elements based on their priority values.Elements with higher priority values are typically retrieved before elements with lower priority values. So,here we will learn the implementation of Priority Queue using Linked List. Linked List is a type of data structure which consists of a node which has two parts,data and next.The data part of the Linked List stores the value that the users asks to store and the next part stores the priority in which it is stored.

Context

The change is important for me because it will help me to contribute to open source programs and enhance my skills in Data Structures and Algorithms.Thus,it will help me in logic building and thus clear my concepts regarding Priority Queue while implementing Linked List.

Possible implementation

No response

Additional information

No response

spyv22072000 commented 10 months ago

@AbhirajBose please can you assign me this issue ?

Rohxn16 commented 10 months ago

i wanna work on this issue.