Saved Bookmarks
| 1. |
Tell Me Something About 'insertion Sort'? |
|
Answer» INSERTION sort divides the list into two sub-list, sorted and unsorted. It TAKES one element at TIME and FINDS it APPROPRIATE location in sorted sub-list and insert there. The output after insertion is a sorted sub-list. It iteratively works on all the elements of unsorted sub-list and inserts them to sorted sub-list in order. Insertion sort divides the list into two sub-list, sorted and unsorted. It takes one element at time and finds it appropriate location in sorted sub-list and insert there. The output after insertion is a sorted sub-list. It iteratively works on all the elements of unsorted sub-list and inserts them to sorted sub-list in order. |
|