bubble sort: comparing adjacent pairs and swapping them if they are in the wrong order, more number of swaps, simple, checks the neighbouring elements and swaps them accordingly, slow, insertion sort: a simple sorting algorithm that builds the final sorted list by transferring one element at a time, less number of swaps, complex, transfers an element at a time to the partially sorted array, fast,

लीडरबोर्ड

दृश्य शैली

विकल्प

टेम्पलेट स्विच करें

ऑटो-सेव पुनःस्थापित करें: ?