Jonghun Park Jhuni0123

## mm-rbtree.c
/*
 * mm-rbtree.c - The most memory-efficient and fast malloc package.
 *
 * This implement use red-black tree to manage memory blocks by their size.
 * When find the block to allocate, this use Best-fit policy for best memory efficiency.
 * The time complexity of malloc & realloc & free is O(log(blocks)) in worst case.
 *
 */
#include <stdio.h>
#include <stdlib.h>

## keybase.md

      
        
          
            
              
              1 file
            
          
          
            
              
              0 forks
            
          
          
            
              
              0 comments
            
          
          
            
              
              0 stars
            
          
        
        
          
              
          
          
            
                Jhuni0123
                / keybase.md
            
            
              Created
              January 19, 2017 10:37
            
          
        
      
        
  
      
    Keybase proof

I hereby claim:

I am jhuni0123 on github.
I am jhuni (https://keybase.io/jhuni) on keybase.
I have a public key whose fingerprint is 3515 4314 5C28 288D 4FAE  2375 DBBA A5D8 01E9 485A

To claim this, I am signing this object:
	/*
	* mm-rbtree.c - The most memory-efficient and fast malloc package.
	*
	* This implement use red-black tree to manage memory blocks by their size.
	* When find the block to allocate, this use Best-fit policy for best memory efficiency.
	* The time complexity of malloc & realloc & free is O(log(blocks)) in worst case.
	*
	*/
	#include <stdio.h>
	#include <stdlib.h>