algorithm3 [Algorithm] Greedy Algorithm [image]Hiker starting at this position and trying to find the highest peak will find a local optimum solution. Internal Scheduling ProblemInput: A set of requests ${1, ..., n}$, where the $i^{th}$ request starts at $s(i)$ and ends at $f(i)$Output: A largest compatible subset of these requests Various attemptsTry #1: Earliest Start Time First (❌) Try #2: Smallest Request First (❌) Try #3: Smalles.. 2025. 7. 18. [Algorithm] Graph Search Algorithms Q. Using Graph Search Algorithm, what are we searching for?A. To find out if there is a path from node A to node B / all nodes that can be reached from A Cf Data Structure = Adjacency Matrix/List Breadth First Search (BFS)Description of operationFirst finds the immediate neighbors of the starting point($s$). (at distance 1 from $s)Then finds nodes at distance 2 from $s$, etc.BFS Tree example Ord.. 2025. 7. 10. [Algorithm] Stable Matching Problem 1.1 Solving problemKey Attributes of an AlgorithmCorrectnessPerformance → Hardware / Software (our focus!)But Software is not independent from Hardware (ex. using GPU for machine learning, SM/DM parallel, memory hierarchy)When studying a problem,we go through the following steps:Come up with a concise problem statementPresent a solution: Finding solution - what techniques are you gonna useProve .. 2025. 7. 9. 이전 1 다음
