I’m starting this serie with the circular buffer. The basic idea of this data structure is to maintain a fixed size buffer Old data is overwritten by new data and retrieval is done in an First In First Out order. For an example, lets consider a circular buffer of size 5. lets perform insertion from