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

This article will explain in detail how to implement the merger and sorting algorithm for 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.

The merging algorithm starts by sorting a segment of numbers that need to be ordered.

Void merg_sort (int* a, int fbegin, int fend, int sbegin, int send, int* b) {int L = fbegin; int R = sbegin; int cursize = fbegin;//z where recursion cannot be repeated with 0 followed by while (L) assigned to the corresponding start position

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.