shell sort put simply shell sort can be thought of as more efficient variation of insertion sort as described in ss it achieves this mainly by comparing items of varying distances apart resulting in run time complexity of ( log nshell sort is fairly straight forward but may seem somewhat confusing at first as it differs from other sorting algorithms in the way it selects items to compare figure shows shell sort being ran on an array of integersthe red coloured square is the current value we are holding algorithm shellsort(list prelist postlist has been sorted into values of ascending order increment list count while increment current increment while current list count hold list[current current increment while > and hold list[ list[ incrementlist[ iincrement end while list[ incrementhold current current end while increment end while return list end shellsort radix sort unlike the sorting algorithms described previously radix sort uses buckets to sort itemseach bucket holds items with particular property called key normally bucket is queueeach time radix sort is performed these buckets are emptied starting the smallest key bucket to the largest when looking at items within list to sort we do so by isolating specific keye in the example we are about to show we have maximum of three keys for all itemsthat is the highest key we need to look at is hundreds because we are dealing within this example base numbers we have at any one point possible key values each of which has their own bucket before we show you this first simple version of radix sort let us clarify what we mean by isolating keys given the number if we look at the first keythe ones then we can see we have two of themprogressing to the next key tens we can see that the number has zero of themfinally we can see that the number has single hundred the number used as an example has in total three keys