This website uses cookies to improve your experience while you navigate through the website. Out of these cookies, the cookies that are categorized as necessary are stored on your browser as they are essential for the working of basic functionalities of the website.

1. C Program For Shell Sort

We also use third-party cookies that help us analyze and understand how you use this website. These cookies will be stored in your browser only with your consent. You also have the option to opt-out of these cookies. But opting out of some of these cookies may have an effect on your browsing experience.

C Program For Shell Sort

This website uses cookies to improve your experience while you navigate through the website. Out of these cookies, the cookies that are categorized as necessary are stored on your browser as they are essential for the working of basic functionalities of the website. We also use third-party cookies that help us analyze and understand how you use this website. These cookies will be stored in your browser only with your consent. You also have the option to opt-out of these cookies. But opting out of some of these cookies may have an effect on your browsing experience.

Code duplicationint32sortimpl and int32sortimpllow are identical except for the part where you create the start bucket. You should merge those two functions into one and just check byteindex to see whether you should create the start bucket for the high byte or for the low bytes. No need for CHARBITYou use CHARBIT in one place but what you really want is 8, since your radix is 256 and you are doing the sort 8 bits at a time.

In fact, if CHARBIT were 16, your sort would not work as written. Three mapsYou currently use three arrays to hold bucket information during the sort. You actually only need one array.

For example, you could get rid of processedMap if you changed: memcpy(target + (startIndexMapbucketindex+ processedMapbucketindex). size, it, size);to: memcpy(target + (startIndexMapbucketindex). size, it, size);You could get rid of startIndexMap by building it in place within bucketSizeMap instead of creating a separate array for it. StabilityYour implementation performs a stable sort, which is good but it requires a copy of the array.

If you used an in-place algorithm, you would use less memory but then the sort would become unstable. Another alternative would be to switch to a LSD radix sort which is stable and faster than MSD.You shouldn't be comparing the results of your sort vs quicksort because quicksort is unstable and your results won't match. The only reason the result comparison works in your test program is because your test arrays only contain keys without any extra data.