heapsort-algorithm

Adapting the Dijkstra's algorithm to find the longest path instead of the shortest

Python Solution for Leetcode Questions

Problems solved in python

this program will sort array in descending order in nlog4n times it creates heap with each root node has at least 4 children. Given a left complete quaternary tree i.e. a parent node can have at max four children. this program will sort array in descending order

Master's | Basic Algorithms & Data structures | Module 8 | Heaps or Pyramids

The implementation of heaps, advance data structure, to organize the friend-relations between the users of a hypothetical webpage.

Welcome to the Data Structures & Algorithms (DSA) journey using Python! This repository contains all the notes, code implementations, practices, and resources to help you master DSA.

Data Structure and Algorithm

Backup of my LeetCode solutions with unit tests

“Implementation of common sorting algorithms in Python”

📚🔢🧮 Master Data Structures & Algorithms with complete lab tasks covering ADTs, Recursion 🔁, Sorting ⬆️⬇️, Stacks & Queues 📥📤, Linked Lists 🔗 (Singly, Doubly, Circular), Trees 🌳, Hash Tables #️⃣, Infix ➡️ Postfix 📐, Maze Solving 🧩, Schedulers ⏱️, Min-Heaps ⛏️, plus final & mid practice, Python files 🐍, project videos 🎥 will guide you

Sorting and Storing algorithms

Algorithm Visualizer using Python

The Heap data structure in Python, with the Heap Sort algorithm

Let's go DeepDiving 🤿

Implementação do algoritmo de ordenação Heapsort em linguagem python

Heap Sort algorithm