SARTHAK SINGH

The lower bound for Comparison based sorting algorithm (Merge Sort, Heap Sort, Quick-Sort .. etc) is Ω(nLogn), i.e., they cannot do better than nLogn. Counting sort is a linear time...

Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort where we first find the maximum element and place the...

### In Memories from FOSSASIA Events section different image popup when clicked on an image for it's preview. As screenshot attached image with Red line have this issue. ...