Shulou(Shulou.com)06/02 Report--

This article will explain in detail how to implement insertion sorting in c #. The editor thinks it is very practical, so I share it for you as a reference. I hope you can get something after reading this article.

Insert sort

1. Directly insert sort

Void InsertSort (int * a, size_t size) / / insert sort directly

{

Assert (a)

For (size_t I = 0; I

= 0 & & a [end] > tmp)

{

A [end + 1] = a [end]

-- end

}

A [end+1] = tmp

}

}

two。 Hill ranking

/ / Hill sort

Void ShellSort (int * a, size_t size)

{

Assert (a)

Int gap = size

While (gap > 1)

{

Gap = gap / 3 + 1

For (size_t I = 0; I

= 0 & & a [end] > tmp)

{

A [end + 1] = a [end]

End = end-gap

}

A [end + gap] = tmp

}

}

}

This is the end of the article on "how to insert sorting". I hope the above content can be helpful to you, so that you can learn more knowledge. if you think the article is good, please share it for more people to see.

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.