Pinned Repositories
BFS
Cogno
Company-System
DFS
E-Commerce
Heap-sort
Max-Heap using an array, supporting insertion, deletion, and heap construction. The insert method adds a value and maintains the heap by bubbling it up, while delete removes the root and restores the heap by bubbling down. The buildup method builds the heap, and deleted root values are stored in a dynamically resized array.
Implementation-of-queue-using-2-stacks
RFM
nourhan247's Repositories
nourhan247/Implementation-of-queue-using-2-stacks
nourhan247/BFS
nourhan247/DFS
nourhan247/RFM
nourhan247/Heap-sort
Max-Heap using an array, supporting insertion, deletion, and heap construction. The insert method adds a value and maintains the heap by bubbling it up, while delete removes the root and restores the heap by bubbling down. The buildup method builds the heap, and deleted root values are stored in a dynamically resized array.
nourhan247/Company-System
nourhan247/Cogno
nourhan247/E-Commerce