courses.cs.washington.edu/courses/cse417/18wi/lectures/lec08-divide-and-conquer-4.pdf
pythoncs.wordpress.com/2015/08/21/question-maximum-single-sell-profit-divide-and-conquer/
Question: Maximum Single-Sell Profit – Divide and Conquer
Question: Given a list of stock prices, find out the maximum profit that can be earned in a single buy/sell transaction. This is a nice Divide and Conquer algorithm. It splits the list in half and …
pythoncs.wordpress.com
'Algorithm > Etc' 카테고리의 다른 글
| [DP] LCS(Longest Common Subsequence, 최장 공통 부분 수열) (0) | 2020.09.24 |
|---|---|
| Dynamic Programming (0) | 2020.09.24 |
| recursion tree - uneven 시간 복잡도 (0) | 2020.09.21 |
| 재귀 시간복잡도 (0) | 2020.09.13 |
| 정렬된 두 배열의 중앙값 찾기 (0) | 2020.09.11 |
