temp 5 List[i]; /* save the element from the set */
j5i − k;
while ((temp <List[j]) && (j >50)) /* find the place for insertion */
{
List[j + k] 5 List[j];
j 5 j − k;
}
List[j + k] 5 temp; /* insert the saved element at its place */
s++; /* go to next set */
}
} /* Print the sorted list*/
printf (“\n The sorted list is ....”);
for (i 5 0; i< size; i++)
{
printf (“%d “, List[i]);
}
}
The analysis of shell sort is beyond the scope of the book.
3.2.5.12 Radix SortIt is a non-comparison-based algorithm suitable for integer values to be
sorted. ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.