Shell Sort in ( C and Python 3 )

-

Shell Sorting

Shell sort is a highly efficient sorting algorithm and is based on insertion sort algorithm. This algorithm avoids large shifts as in case of insertion sort, if the smaller value is to the far right and has to be moved to the far left.
This algorithm uses insertion sort on a widely spread elements, first to sort them and then sorts the less widely spaced elements. This spacing is termed as interval. This interval is calculated based on Knuth's formula as −

Time Complexity

 Best Case Scenario : O( n )
Average Case Scenario : O( n log n )
Worst Case Scenario : O( n ^ 1.25 )   

Knuth's Formula

h = h * 3 + 1
where −
   h is interval with initial value 1

This algorithm is quite efficient for medium-sized data sets as its average and worst-case complexity of this algorithm depends on the gap sequence the best known is Ο(n), where n is the number of items. And the worst case space complexity is O(n).

Shell Sorting in C



Shell Sorting in Python 3


asokaosk
Abhishek Manna is a 1st Year undergraduate perusing Electronics & Communication engineering.

Comments

Post a Comment

Popular posts from this blog

Bubble Sort ( C & Python 3)

-
Image
Bubble Sort Algorithm Bubble Sort   is a simple algorithm which is used to sort a given set of  n   elements provided in form of an array with  n  number of elements. Bubble Sort compares all the element one by one and sort them based on their values. If the given array has to be sorted in ascending order, then bubble sort will start by comparing the first element of the array with the second element, if the first element is greater than the second element, it will  swap   both the elements, and then move on to compare the second and the third element, and so on. If we have tota l   n   elements, then we need to repeat this process for  n-1  times. It is known as  bubble sort , because with every complete iteration the largest element in the given array, bubbles up towards the last place or the highest index, just like a water bubble rises up to the water surface. Sorting takes place by stepping through all the elements one-by-one and comparing it with the adjacent elemen
Read more

Comparison Logical and Bitwise Operator ( Java Part - 4 )

-
J ava Comparison Operators Comparison operators are used to compare two values: Operator Name Example Try it == Equal to x == y Try it » != Not equal x != y Try it » > Greater than x > y Try it » < Less than x < y Try it » >= Greater than or equal to x >= y Try it » <= Less than or equal to x <= y Try it » Java Logical Operators Logical operators are used to determine the logic between variables or values: Operator Name Description Example Try it &&  Logical and Returns true if both statements are true x < 5 &&  x < 10 Try it » ||  Logical or Returns true if one of the statements is true x < 5 || x < 4 Try it » ! Logical not Reverse the result, returns false if the result is true !(x < 5 && x < 10) Try it » Java Bitwise Operators Bitwise operators are used to perform binary logic with the bits of an integer or long integer. Operator Description Example Same as Result Decimal & AND -
Read more

Something about me

-
Image
Something about me  H ey peeps, its me Abhishek and it's my first blog ever . I wanted to write something about me, but you know there are people about whom you can write about a trillion lines about their deeds, achievements and there are some people like me, having no achievements and nothing to write about, a single line would be too long I guess lol. Jokes apart, through this blog I will convey and provide all the study materials, which I could gather in my B-tech college life.
Read more