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

This article mainly introduces "how to realize the C++ merge sorting algorithm". In the daily operation, I believe many people have doubts about how to realize the C++ merge sorting algorithm. The editor consulted all kinds of materials and sorted out the simple and easy-to-use operation methods. I hope it will be helpful to answer the doubts about "how to realize the C++ merge sorting algorithm". Next, please follow the editor to study!

one。 Brief introduction of algorithm

The average time complexity of the merging and sorting algorithm is O (nlogn). The implementation of the merging algorithm is to divide a sequence to be arranged into small sequences, then sort these small sequences, and then merge them, and then sort them, so that they can be divided into small blocks and then synthesized from small blocks.

two。 Realization process

1) split the sequence to be arranged

2) sort and merge

Write a simple process for everyone to understand.

This is basically the principle of merging and sorting, so how is the code implemented? let's show you the code implementation.

/ / the time complexity is nlogn#include using namespace std; void Merge (int a [], int srec int mid,int eLint tmp []); / merging void Merge_Sort (int a [], int srech int eRep int tmp []); / / ordered int main () {int a [1000], tmp [1000]; int n; cin > > n; for (int ionomy 0 leadership I > a [I]; Merge_Sort (int 0Pert nlum TMP) / / sort the array for (int item0posii

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.