JamesFlare/CSCI-1200
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

line breaks and indent

Browse Source
This commit is contained in:
Jidong Xiao
2023-10-08 17:31:34 -04:00
parent 28b886ba8a
commit 0c2fafc28d
1 changed files with 6 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
lectures/12_advanced_recursion/README.md
View File

@@ -1,7 +1,8 @@
# Lecture 12 --- Advanced Recursion # Lecture 12 --- Advanced Recursion
Review Recursion vs. Iteration Review Recursion vs. Iteration
– Binary Search
- Binary Search
- “Rules” for writing recursive functions - “Rules” for writing recursive functions
- Advanced Recursion — problems that cannot be easily solved using iteration (for or while loops): - Advanced Recursion — problems that cannot be easily solved using iteration (for or while loops):
– Merge sort – Merge sort
@@ -38,7 +39,8 @@ bool binsearch(const std::vector<T> &v, int low, int high, const T &x) {
return binsearch(v, low, mid, x); return binsearch(v, low, mid, x);
else else
return binsearch(v, mid+1, high, x); return binsearch(v, mid+1, high, x);
} }
template <class T> template <class T>
bool binsearch(const std::vector<T> &v, const T &x) { bool binsearch(const std::vector<T> &v, const T &x) {
return binsearch(v, 0, v.size()-1, x); return binsearch(v, 0, v.size()-1, x);