alecksandr26/mem-c

mem-c is a simple memory allocator using a heap data structure with the mmap Linux syscall for dynamic memory management. It has a worst-case search time of O(n * log n) and averages O(log n). The allocator supports memory pagination, chunk merging, and plans for advanced features like garbage collection and arenas.

Language: C - Size: 669 KB - Last synced at: 4 months ago - Pushed at: 4 months ago - Stars: 2 - Forks: 0

manuchaitanya17/Advanced-Data-Structures-Algorithms

A Course for learning Advanced Data Structures Algorithms.

Language: Java - Size: 1.25 MB - Last synced at: 2 months ago - Pushed at: 6 months ago - Stars: 0 - Forks: 0

BURMAUG/Huffman-encoding

This program performs data compression using the Huffman encoding algorithm.

Language: Go - Size: 21.5 KB - Last synced at: 12 months ago - Pushed at: 12 months ago - Stars: 0 - Forks: 0

khansamad99/khansamad99.github.io

Reduces number of transactions,implementeda feature of Splitwise using Heap Data Struture

Language: JavaScript - Size: 5.86 KB - Last synced at: about 1 year ago - Pushed at: over 1 year ago - Stars: 1 - Forks: 0

muhammad-alamin1/heap-in-c

Language: C - Size: 2.93 KB - Last synced at: almost 2 years ago - Pushed at: over 3 years ago - Stars: 0 - Forks: 0

ArpanMaheshwari144/Heap-Data-Structure

A heap is a specialized tree-based data structure which is essentially an almost complete tree that satisfies the heap property: in a max heap, for any given node C, if P is a parent node of C, then the key (the value) of P is greater than or equal to the key of C. In a min-heap, the key of P is less than or equal to the key of C. The node at the "top" of the heap (with no parents) is called the root node.

Language: C++ - Size: 131 KB - Last synced at: over 2 years ago - Pushed at: over 3 years ago - Stars: 0 - Forks: 0