diff --git a/d0/db6/non__recursive__merge__sort_8cpp.html b/d0/db6/non__recursive__merge__sort_8cpp.html index 3e654b94c..865dcf7de 100644 --- a/d0/db6/non__recursive__merge__sort_8cpp.html +++ b/d0/db6/non__recursive__merge__sort_8cpp.html @@ -274,7 +274,7 @@ template<class Iterator>
45 }
46 delete[] buffer;
47}
-
merge
void merge(int *arr, int l, int m, int r)
Definition merge_sort.cpp:33
+
merge
void merge(int *arr, int l, int m, int r)
Definition merge_sort.cpp:36
diff --git a/d5/d1e/tim__sort_8cpp_source.html b/d5/d1e/tim__sort_8cpp_source.html index e2e278380..3205b9517 100644 --- a/d5/d1e/tim__sort_8cpp_source.html +++ b/d5/d1e/tim__sort_8cpp_source.html @@ -248,7 +248,7 @@ $(function(){initNavTree('d5/d1e/tim__sort_8cpp_source.html','../../'); initResi
numerical_methods::simpson_method::k
double k(double x)
Another test function.
Definition composite_simpson_rule.cpp:117
numerical_methods::simpson_method::l
double l(double x)
Another test function.
Definition composite_simpson_rule.cpp:119
main
int main()
Main function.
Definition generate_parentheses.cpp:110
-
merge
void merge(int *arr, int l, int m, int r)
Definition merge_sort.cpp:33
+
merge
void merge(int *arr, int l, int m, int r)
Definition merge_sort.cpp:36
printArray
void printArray(T *arr, int sz)
Definition heap_sort.cpp:37
tests
Testcases to check Union of Two Arrays.
diff --git a/d5/d4c/group__sorting.html b/d5/d4c/group__sorting.html index ad7485da6..67371ce68 100644 --- a/d5/d4c/group__sorting.html +++ b/d5/d4c/group__sorting.html @@ -338,23 +338,23 @@ template<typename T>

Main function

Driver Code

-

Definition at line 90 of file merge_sort.cpp.

-
90 {
-
91 int size;
-
92 std::cout << "Enter the number of elements : ";
-
93 std::cin >> size;
-
94 int *arr = new int[size];
-
95 std::cout << "Enter the unsorted elements : ";
-
96 for (int i = 0; i < size; ++i) {
-
97 std::cin >> arr[i];
-
98 }
-
99 mergeSort(arr, 0, size - 1);
-
100 std::cout << "Sorted array : ";
-
101 show(arr, size);
-
102 delete[] arr;
-
103 return 0;
-
104}
-
mergeSort
void mergeSort(int *arr, int l, int r)
Definition merge_sort.cpp:71
+

Definition at line 93 of file merge_sort.cpp.

+
93 {
+
94 int size;
+
95 std::cout << "Enter the number of elements : ";
+
96 std::cin >> size;
+
97 int *arr = new int[size];
+
98 std::cout << "Enter the unsorted elements : ";
+
99 for (int i = 0; i < size; ++i) {
+
100 std::cin >> arr[i];
+
101 }
+
102 mergeSort(arr, 0, size - 1);
+
103 std::cout << "Sorted array : ";
+
104 show(arr, size);
+
105 delete[] arr;
+
106 return 0;
+
107}
+
mergeSort
void mergeSort(int *arr, int l, int r)
Definition merge_sort.cpp:74
@@ -403,34 +403,34 @@ template<typename T> -

Definition at line 33 of file merge_sort.cpp.

-
33 {
-
34 int i, j, k;
-
35 int n1 = m - l + 1;
-
36 int n2 = r - m;
-
37
-
38 int *L = new int[n1], *R = new int[n2];
-
39
-
40 for (i = 0; i < n1; i++) L[i] = arr[l + i];
-
41 for (j = 0; j < n2; j++) R[j] = arr[m + 1 + j];
+

Definition at line 36 of file merge_sort.cpp.

+
36 {
+
37 int i, j, k;
+
38 int n1 = m - l + 1;
+
39 int n2 = r - m;
+
40
+
41 int *L = new int[n1], *R = new int[n2];
42
-
43 i = 0;
-
44 j = 0;
-
45 k = l;
-
46 while (i < n1 || j < n2) {
-
47 if (j >= n2 || (i < n1 && L[i] <= R[j])) {
-
48 arr[k] = L[i];
-
49 i++;
-
50 } else {
-
51 arr[k] = R[j];
-
52 j++;
-
53 }
-
54 k++;
-
55 }
-
56
-
57 delete[] L;
-
58 delete[] R;
-
59}
+
43 for (i = 0; i < n1; i++) L[i] = arr[l + i];
+
44 for (j = 0; j < n2; j++) R[j] = arr[m + 1 + j];
+
45
+
46 i = 0;
+
47 j = 0;
+
48 k = l;
+
49 while (i < n1 || j < n2) {
+
50 if (j >= n2 || (i < n1 && L[i] <= R[j])) {
+
51 arr[k] = L[i];
+
52 i++;
+
53 } else {
+
54 arr[k] = R[j];
+
55 j++;
+
56 }
+
57 k++;
+
58 }
+
59
+
60 delete[] L;
+
61 delete[] R;
+
62}
numerical_methods::simpson_method::k
double k(double x)
Another test function.
Definition composite_simpson_rule.cpp:117
@@ -468,16 +468,16 @@ template<typename T> -

Definition at line 71 of file merge_sort.cpp.

-
71 {
-
72 if (l < r) {
-
73 int m = l + (r - l) / 2;
-
74 mergeSort(arr, l, m);
-
75 mergeSort(arr, m + 1, r);
-
76 merge(arr, l, m, r);
-
77 }
-
78}
-
merge
void merge(int *arr, int l, int m, int r)
Definition merge_sort.cpp:33
+

Definition at line 74 of file merge_sort.cpp.

+
74 {
+
75 if (l < r) {
+
76 int m = l + (r - l) / 2;
+
77 mergeSort(arr, l, m);
+
78 mergeSort(arr, m + 1, r);
+
79 merge(arr, l, m, r);
+
80 }
+
81}
+
merge
void merge(int *arr, int l, int m, int r)
Definition merge_sort.cpp:36
@@ -501,11 +501,11 @@ template<typename T>

Utility function used to print the array after sorting

-

Definition at line 84 of file merge_sort.cpp.

-
84 {
-
85 for (int i = 0; i < size; i++) std::cout << arr[i] << " ";
-
86 std::cout << "\n";
-
87}
+

Definition at line 87 of file merge_sort.cpp.

+
87 {
+
88 for (int i = 0; i < size; i++) std::cout << arr[i] << " ";
+
89 std::cout << "\n";
+
90}
diff --git a/d5/df4/merge__sort_8cpp.html b/d5/df4/merge__sort_8cpp.html index a0888a1f8..0f059ef9b 100644 --- a/d5/df4/merge__sort_8cpp.html +++ b/d5/df4/merge__sort_8cpp.html @@ -152,7 +152,7 @@ Functions

Detailed Description

Merege Sort Algorithm (MEREGE SORT) implementation

Author
Ayaan Khan
-

Merge Sort is an efficient, general purpose, comparison based sorting algorithm. Merge Sort is a divide and conquer algorithm

+

Merge Sort is an efficient, general purpose, comparison based sorting algorithm. Merge Sort is a divide and conquer algorithm Time Complexity: O(n log n) It is same for all best case, worst case or average case Merge Sort is very efficient when for the small data. In built-in sort function merge sort along with quick sort is used.

Definition in file merge_sort.cpp.

diff --git a/d5/df4/merge__sort_8cpp_source.html b/d5/df4/merge__sort_8cpp_source.html index 03cfd57d4..75f703b02 100644 --- a/d5/df4/merge__sort_8cpp_source.html +++ b/d5/df4/merge__sort_8cpp_source.html @@ -125,77 +125,77 @@ $(function(){initNavTree('d5/df4/merge__sort_8cpp_source.html','../../'); initRe
Go to the documentation of this file.
1
-
16#include <iostream>
-
17
-
-
33void merge(int *arr, int l, int m, int r) {
-
34 int i, j, k;
-
35 int n1 = m - l + 1;
-
36 int n2 = r - m;
-
37
-
38 int *L = new int[n1], *R = new int[n2];
-
39
-
40 for (i = 0; i < n1; i++) L[i] = arr[l + i];
-
41 for (j = 0; j < n2; j++) R[j] = arr[m + 1 + j];
+
19#include <iostream>
+
20
+
+
36void merge(int *arr, int l, int m, int r) {
+
37 int i, j, k;
+
38 int n1 = m - l + 1;
+
39 int n2 = r - m;
+
40
+
41 int *L = new int[n1], *R = new int[n2];
42
-
43 i = 0;
-
44 j = 0;
-
45 k = l;
-
46 while (i < n1 || j < n2) {
-
47 if (j >= n2 || (i < n1 && L[i] <= R[j])) {
-
48 arr[k] = L[i];
-
49 i++;
-
50 } else {
-
51 arr[k] = R[j];
-
52 j++;
-
53 }
-
54 k++;
-
55 }
-
56
-
57 delete[] L;
-
58 delete[] R;
-
59}
+
43 for (i = 0; i < n1; i++) L[i] = arr[l + i];
+
44 for (j = 0; j < n2; j++) R[j] = arr[m + 1 + j];
+
45
+
46 i = 0;
+
47 j = 0;
+
48 k = l;
+
49 while (i < n1 || j < n2) {
+
50 if (j >= n2 || (i < n1 && L[i] <= R[j])) {
+
51 arr[k] = L[i];
+
52 i++;
+
53 } else {
+
54 arr[k] = R[j];
+
55 j++;
+
56 }
+
57 k++;
+
58 }
+
59
+
60 delete[] L;
+
61 delete[] R;
+
62}
-
60
-
-
71void mergeSort(int *arr, int l, int r) {
-
72 if (l < r) {
-
73 int m = l + (r - l) / 2;
-
74 mergeSort(arr, l, m);
-
75 mergeSort(arr, m + 1, r);
-
76 merge(arr, l, m, r);
-
77 }
-
78}
+
63
+
+
74void mergeSort(int *arr, int l, int r) {
+
75 if (l < r) {
+
76 int m = l + (r - l) / 2;
+
77 mergeSort(arr, l, m);
+
78 mergeSort(arr, m + 1, r);
+
79 merge(arr, l, m, r);
+
80 }
+
81}
-
79
-
-
84void show(int *arr, int size) {
-
85 for (int i = 0; i < size; i++) std::cout << arr[i] << " ";
-
86 std::cout << "\n";
-
87}
+
82
+
+
87void show(int *arr, int size) {
+
88 for (int i = 0; i < size; i++) std::cout << arr[i] << " ";
+
89 std::cout << "\n";
+
90}
-
88
-
-
90int main() {
-
91 int size;
-
92 std::cout << "Enter the number of elements : ";
-
93 std::cin >> size;
-
94 int *arr = new int[size];
-
95 std::cout << "Enter the unsorted elements : ";
-
96 for (int i = 0; i < size; ++i) {
-
97 std::cin >> arr[i];
-
98 }
-
99 mergeSort(arr, 0, size - 1);
-
100 std::cout << "Sorted array : ";
-
101 show(arr, size);
-
102 delete[] arr;
-
103 return 0;
-
104}
+
91
+
+
93int main() {
+
94 int size;
+
95 std::cout << "Enter the number of elements : ";
+
96 std::cin >> size;
+
97 int *arr = new int[size];
+
98 std::cout << "Enter the unsorted elements : ";
+
99 for (int i = 0; i < size; ++i) {
+
100 std::cin >> arr[i];
+
101 }
+
102 mergeSort(arr, 0, size - 1);
+
103 std::cout << "Sorted array : ";
+
104 show(arr, size);
+
105 delete[] arr;
+
106 return 0;
+
107}
-
105
-
merge
void merge(int *arr, int l, int m, int r)
Definition merge_sort.cpp:33
-
mergeSort
void mergeSort(int *arr, int l, int r)
Definition merge_sort.cpp:71
-
main
int main()
Definition merge_sort.cpp:90
+
108
+
merge
void merge(int *arr, int l, int m, int r)
Definition merge_sort.cpp:36
+
mergeSort
void mergeSort(int *arr, int l, int r)
Definition merge_sort.cpp:74
+
main
int main()
Definition merge_sort.cpp:93
diff --git a/de/d7b/merge__insertion__sort_8cpp.html b/de/d7b/merge__insertion__sort_8cpp.html index c99fb833f..72a8afb45 100644 --- a/de/d7b/merge__insertion__sort_8cpp.html +++ b/de/d7b/merge__insertion__sort_8cpp.html @@ -437,7 +437,7 @@ template<typename T, size_t N>
121 merge(array, min, max, mid);
122 }
123}
-
mergeSort
void mergeSort(int *arr, int l, int r)
Definition merge_sort.cpp:71
+
mergeSort
void mergeSort(int *arr, int l, int r)
Definition merge_sort.cpp:74
sorting::merge_insertion::InsertionSort
static void InsertionSort(std::array< T, N > *A, size_t start, size_t end)
Insertion merge algorithm.
Definition merge_insertion_sort.cpp:37
sorting::merge
void merge(Iterator, Iterator, const Iterator, char[])
merges 2 sorted adjacent segments into a larger sorted segment
Definition non_recursive_merge_sort.cpp:57