sashaafm / exads

Algorithms and Data Structures collection in Elixir
83 stars 12 forks source link

Implement efficient Priority Queue #25

Open MarinShalamanov opened 7 years ago

MarinShalamanov commented 7 years ago

Current implementation stores the values in list, which is sorted before each extract_min operation. This is rather inefficient. Consider implementing a heap