(
int*arr,
intl,
intm,
intr) {
41std::vector<int> L(n1), R(n2);
43 for(
inti = 0; i < n1; i++) L[i] = arr[l + i];
44 for(
intj = 0; j < n2; j++) R[j] = arr[m + 1 + j];
46 inti = 0, j = 0, k = l;
48 while(i < n1 && j < n2) {
84 intm = l + (r - l) / 2;
95void show(
int*arr,
intsize) {
96 for(
inti = 0; i < size; i++) std::cout << arr[i] <<
" ";
103std::cout <<
"Enter the number of elements: ";
107std::cout <<
"Invalid size.\n";
111 int*arr =
new int[size];
112std::cout <<
"Enter the unsorted elements: ";
113 for(
inti = 0; i < size; ++i) {
118std::cout <<
"Sorted array: ";
void show(int *arr, int size)
void merge(int *arr, int l, int m, int r)
void mergeSort(int *arr, int l, int r)
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4