mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-05-03 06:20:29 +08:00
Documentation for 3f6876f03f
This commit is contained in:
realstealthninja
@@ -338,23 +338,23 @@ template<typename T> </div>
|
||||
<p>Main function</p>
|
||||
<p>Driver Code </p>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html#l00090">90</a> of file <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html">merge_sort.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 90</span> {</div>
|
||||
<div class="line"><span class="lineno"> 91</span> <span class="keywordtype">int</span> size;</div>
|
||||
<div class="line"><span class="lineno"> 92</span> std::cout << <span class="stringliteral">"Enter the number of elements : "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 93</span> std::cin >> size;</div>
|
||||
<div class="line"><span class="lineno"> 94</span> <span class="keywordtype">int</span> *arr = <span class="keyword">new</span> <span class="keywordtype">int</span>[size];</div>
|
||||
<div class="line"><span class="lineno"> 95</span> std::cout << <span class="stringliteral">"Enter the unsorted elements : "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 96</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 97</span> std::cin >> arr[i];</div>
|
||||
<div class="line"><span class="lineno"> 98</span> }</div>
|
||||
<div class="line"><span class="lineno"> 99</span> <a class="code hl_function" href="#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(arr, 0, size - 1);</div>
|
||||
<div class="line"><span class="lineno"> 100</span> std::cout << <span class="stringliteral">"Sorted array : "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 101</span> show(arr, size);</div>
|
||||
<div class="line"><span class="lineno"> 102</span> <span class="keyword">delete</span>[] arr;</div>
|
||||
<div class="line"><span class="lineno"> 103</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 104</span>}</div>
|
||||
<div class="ttc" id="agroup__sorting_html_gab6b14fea48d9841e29b9fc26be6e05d7"><div class="ttname"><a href="#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a></div><div class="ttdeci">void mergeSort(int *arr, int l, int r)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/df4/merge__sort_8cpp_source.html#l00071">merge_sort.cpp:71</a></div></div>
|
||||
<p class="definition">Definition at line <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html#l00093">93</a> of file <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html">merge_sort.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 93</span> {</div>
|
||||
<div class="line"><span class="lineno"> 94</span> <span class="keywordtype">int</span> size;</div>
|
||||
<div class="line"><span class="lineno"> 95</span> std::cout << <span class="stringliteral">"Enter the number of elements : "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 96</span> std::cin >> size;</div>
|
||||
<div class="line"><span class="lineno"> 97</span> <span class="keywordtype">int</span> *arr = <span class="keyword">new</span> <span class="keywordtype">int</span>[size];</div>
|
||||
<div class="line"><span class="lineno"> 98</span> std::cout << <span class="stringliteral">"Enter the unsorted elements : "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 99</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 100</span> std::cin >> arr[i];</div>
|
||||
<div class="line"><span class="lineno"> 101</span> }</div>
|
||||
<div class="line"><span class="lineno"> 102</span> <a class="code hl_function" href="#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(arr, 0, size - 1);</div>
|
||||
<div class="line"><span class="lineno"> 103</span> std::cout << <span class="stringliteral">"Sorted array : "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 104</span> show(arr, size);</div>
|
||||
<div class="line"><span class="lineno"> 105</span> <span class="keyword">delete</span>[] arr;</div>
|
||||
<div class="line"><span class="lineno"> 106</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 107</span>}</div>
|
||||
<div class="ttc" id="agroup__sorting_html_gab6b14fea48d9841e29b9fc26be6e05d7"><div class="ttname"><a href="#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a></div><div class="ttdeci">void mergeSort(int *arr, int l, int r)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/df4/merge__sort_8cpp_source.html#l00074">merge_sort.cpp:74</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -403,34 +403,34 @@ template<typename T> </div>
|
||||
</dd>
|
||||
</dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html#l00033">33</a> of file <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html">merge_sort.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 33</span> {</div>
|
||||
<div class="line"><span class="lineno"> 34</span> <span class="keywordtype">int</span> i, j, <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>;</div>
|
||||
<div class="line"><span class="lineno"> 35</span> <span class="keywordtype">int</span> n1 = m - <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a> + 1;</div>
|
||||
<div class="line"><span class="lineno"> 36</span> <span class="keywordtype">int</span> n2 = r - m;</div>
|
||||
<div class="line"><span class="lineno"> 37</span> </div>
|
||||
<div class="line"><span class="lineno"> 38</span> <span class="keywordtype">int</span> *L = <span class="keyword">new</span> <span class="keywordtype">int</span>[n1], *R = <span class="keyword">new</span> <span class="keywordtype">int</span>[n2];</div>
|
||||
<div class="line"><span class="lineno"> 39</span> </div>
|
||||
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">for</span> (i = 0; i < n1; i++) L[i] = arr[l + i];</div>
|
||||
<div class="line"><span class="lineno"> 41</span> <span class="keywordflow">for</span> (j = 0; j < n2; j++) R[j] = arr[m + 1 + j];</div>
|
||||
<p class="definition">Definition at line <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html#l00036">36</a> of file <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html">merge_sort.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 36</span> {</div>
|
||||
<div class="line"><span class="lineno"> 37</span> <span class="keywordtype">int</span> i, j, <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>;</div>
|
||||
<div class="line"><span class="lineno"> 38</span> <span class="keywordtype">int</span> n1 = m - <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a> + 1;</div>
|
||||
<div class="line"><span class="lineno"> 39</span> <span class="keywordtype">int</span> n2 = r - m;</div>
|
||||
<div class="line"><span class="lineno"> 40</span> </div>
|
||||
<div class="line"><span class="lineno"> 41</span> <span class="keywordtype">int</span> *L = <span class="keyword">new</span> <span class="keywordtype">int</span>[n1], *R = <span class="keyword">new</span> <span class="keywordtype">int</span>[n2];</div>
|
||||
<div class="line"><span class="lineno"> 42</span> </div>
|
||||
<div class="line"><span class="lineno"> 43</span> i = 0;</div>
|
||||
<div class="line"><span class="lineno"> 44</span> j = 0;</div>
|
||||
<div class="line"><span class="lineno"> 45</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>;</div>
|
||||
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">while</span> (i < n1 || j < n2) {</div>
|
||||
<div class="line"><span class="lineno"> 47</span> <span class="keywordflow">if</span> (j >= n2 || (i < n1 && L[i] <= R[j])) {</div>
|
||||
<div class="line"><span class="lineno"> 48</span> arr[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>] = L[i];</div>
|
||||
<div class="line"><span class="lineno"> 49</span> i++;</div>
|
||||
<div class="line"><span class="lineno"> 50</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 51</span> arr[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>] = R[j];</div>
|
||||
<div class="line"><span class="lineno"> 52</span> j++;</div>
|
||||
<div class="line"><span class="lineno"> 53</span> }</div>
|
||||
<div class="line"><span class="lineno"> 54</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++;</div>
|
||||
<div class="line"><span class="lineno"> 55</span> }</div>
|
||||
<div class="line"><span class="lineno"> 56</span> </div>
|
||||
<div class="line"><span class="lineno"> 57</span> <span class="keyword">delete</span>[] L;</div>
|
||||
<div class="line"><span class="lineno"> 58</span> <span class="keyword">delete</span>[] R;</div>
|
||||
<div class="line"><span class="lineno"> 59</span>}</div>
|
||||
<div class="line"><span class="lineno"> 43</span> <span class="keywordflow">for</span> (i = 0; i < n1; i++) L[i] = arr[l + i];</div>
|
||||
<div class="line"><span class="lineno"> 44</span> <span class="keywordflow">for</span> (j = 0; j < n2; j++) R[j] = arr[m + 1 + j];</div>
|
||||
<div class="line"><span class="lineno"> 45</span> </div>
|
||||
<div class="line"><span class="lineno"> 46</span> i = 0;</div>
|
||||
<div class="line"><span class="lineno"> 47</span> j = 0;</div>
|
||||
<div class="line"><span class="lineno"> 48</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>;</div>
|
||||
<div class="line"><span class="lineno"> 49</span> <span class="keywordflow">while</span> (i < n1 || j < n2) {</div>
|
||||
<div class="line"><span class="lineno"> 50</span> <span class="keywordflow">if</span> (j >= n2 || (i < n1 && L[i] <= R[j])) {</div>
|
||||
<div class="line"><span class="lineno"> 51</span> arr[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>] = L[i];</div>
|
||||
<div class="line"><span class="lineno"> 52</span> i++;</div>
|
||||
<div class="line"><span class="lineno"> 53</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 54</span> arr[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>] = R[j];</div>
|
||||
<div class="line"><span class="lineno"> 55</span> j++;</div>
|
||||
<div class="line"><span class="lineno"> 56</span> }</div>
|
||||
<div class="line"><span class="lineno"> 57</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++;</div>
|
||||
<div class="line"><span class="lineno"> 58</span> }</div>
|
||||
<div class="line"><span class="lineno"> 59</span> </div>
|
||||
<div class="line"><span class="lineno"> 60</span> <span class="keyword">delete</span>[] L;</div>
|
||||
<div class="line"><span class="lineno"> 61</span> <span class="keyword">delete</span>[] R;</div>
|
||||
<div class="line"><span class="lineno"> 62</span>}</div>
|
||||
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
@@ -468,16 +468,16 @@ template<typename T> </div>
|
||||
</dd>
|
||||
</dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html#l00071">71</a> of file <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html">merge_sort.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 71</span> {</div>
|
||||
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">if</span> (l < r) {</div>
|
||||
<div class="line"><span class="lineno"> 73</span> <span class="keywordtype">int</span> m = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a> + (r - <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>) / 2;</div>
|
||||
<div class="line"><span class="lineno"> 74</span> <a class="code hl_function" href="#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(arr, l, m);</div>
|
||||
<div class="line"><span class="lineno"> 75</span> <a class="code hl_function" href="#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(arr, m + 1, r);</div>
|
||||
<div class="line"><span class="lineno"> 76</span> <a class="code hl_function" href="#ga460c61cd948203b4816bef2accb3fc73">merge</a>(arr, l, m, r);</div>
|
||||
<div class="line"><span class="lineno"> 77</span> }</div>
|
||||
<div class="line"><span class="lineno"> 78</span>}</div>
|
||||
<div class="ttc" id="agroup__sorting_html_ga460c61cd948203b4816bef2accb3fc73"><div class="ttname"><a href="#ga460c61cd948203b4816bef2accb3fc73">merge</a></div><div class="ttdeci">void merge(int *arr, int l, int m, int r)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/df4/merge__sort_8cpp_source.html#l00033">merge_sort.cpp:33</a></div></div>
|
||||
<p class="definition">Definition at line <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html#l00074">74</a> of file <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html">merge_sort.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 74</span> {</div>
|
||||
<div class="line"><span class="lineno"> 75</span> <span class="keywordflow">if</span> (l < r) {</div>
|
||||
<div class="line"><span class="lineno"> 76</span> <span class="keywordtype">int</span> m = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a> + (r - <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>) / 2;</div>
|
||||
<div class="line"><span class="lineno"> 77</span> <a class="code hl_function" href="#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(arr, l, m);</div>
|
||||
<div class="line"><span class="lineno"> 78</span> <a class="code hl_function" href="#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(arr, m + 1, r);</div>
|
||||
<div class="line"><span class="lineno"> 79</span> <a class="code hl_function" href="#ga460c61cd948203b4816bef2accb3fc73">merge</a>(arr, l, m, r);</div>
|
||||
<div class="line"><span class="lineno"> 80</span> }</div>
|
||||
<div class="line"><span class="lineno"> 81</span>}</div>
|
||||
<div class="ttc" id="agroup__sorting_html_ga460c61cd948203b4816bef2accb3fc73"><div class="ttname"><a href="#ga460c61cd948203b4816bef2accb3fc73">merge</a></div><div class="ttdeci">void merge(int *arr, int l, int m, int r)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/df4/merge__sort_8cpp_source.html#l00036">merge_sort.cpp:36</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -501,11 +501,11 @@ template<typename T> </div>
|
||||
</div><div class="memdoc">
|
||||
<p>Utility function used to print the array after sorting </p>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html#l00084">84</a> of file <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html">merge_sort.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 84</span> {</div>
|
||||
<div class="line"><span class="lineno"> 85</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; i++) std::cout << arr[i] << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 86</span> std::cout << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 87</span>}</div>
|
||||
<p class="definition">Definition at line <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html#l00087">87</a> of file <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html">merge_sort.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 87</span> {</div>
|
||||
<div class="line"><span class="lineno"> 88</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; i++) std::cout << arr[i] << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 89</span> std::cout << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 90</span>}</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
|
||||
Reference in New Issue
Block a user