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

This article mainly introduces "what are the methods of C language data structure and algorithm sorting". In daily operations, I believe that many people have doubts about the methods of C language data structure and algorithm sorting. The editor consulted all kinds of materials and sorted out simple and easy-to-use operation methods. I hope it will be helpful for you to answer the doubts about "C language data structure and algorithm sorting methods". Next, please follow the editor to study!

I. Preface

This paper mainly introduces the cardinality sort of simple, tree and heap sort, merge sort and allocation class sort in selection class sorting.

Second, select the category to sort

Select class: each time from the unordered sequence to be sorted, select a maximum or minimum number, put it in front, and the sort ends when the data element is empty.

1. Simple selection sort

Dynamic demo:

Algorithm explanation:

First of all, through a comparison of nMel, we find the minimum value from n records and exchange it with the first element.

Then through two comparisons of nmurs, the second smallest value is found from the remaining nmur1 record, and it is exchanged with the second record.

Repeat the above operation nmur1, and the sorting is complete.

Code:

Void SelectSort (RecordType r [], int length) / * makes a simple selection sort of the record array r, where length is the length of the array * / {int iGrad jPowerk; int n; RecordType x; nymphs; for (item1; I)

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.