memory - Datastructure + Algorithm for storing non-overlapping intervals -


I was wondering if any of you knew in a space efficient way of storing non-overlapping intervals. My ultimate goal is to use it to assign virtual address space (I'm writing an operating system for fun) and wanted to know whether O (n) space complexity and better location than O (n) search Can store complexity

A possible data structure can work because I can find out if address space is available, always the page table can run.

Thank you.

It can be used for 2D (and possibly n-dimensional) structures as well Used but can also manage 1D items as required by you.


Comments

Popular posts from this blog

python - Overriding the save method in Django ModelForm -

html - CSS autoheight, but fit content to height of div -

qt - How to prevent QAudioInput from automatically boosting the master volume to 100%? -