TAILIEUCHUNG - Chapter 13 Recursion

Reduce problem into smaller instances of same problem - recursive solution Recursive algorithm has two cases: Base/stopping case Recursive case, Ensure no infinite recursion. Use criteria to determine recursion correct | Chapter 13 Recursion Learning Objectives Recursive void Functions Tracing recursive calls Infinite recursion, overflows Recursive Functions that Return a Value Powers function Thinking Recursively Recursive design techniques Binary search Introduction to Recursion A function that "calls itself" Said to be recursive In function definition, call to same function C++ allows recursion As do most high-level languages Can be useful programming technique Has limitations Recursive void Functions Divide and Conquer Basic design technique Break large task into subtasks Subtasks could be smaller versions of the original task! When they are recursion Recursive void Function Example Consider task: Search list for a value Subtask 1: search 1st half of list Subtask 2: search 2nd half of list Subtasks are smaller versions of original task! When this occurs, recursive function can be used. Usually results in "elegant" solution Recursive void Function: Vertical Numbers Task: display digits of .

Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.