zunia.vn

Tuyển sinh 2024 dành cho Gen-Z

zunia.vn

» Công Nghệ Thông Tin

» Cơ sở dữ liệu

Lecture Data Structures & Algorithms: Chapter 2

Chia sẻ: Na Na | Ngày: | Loại File: PPTX | Số trang:35

Báo xấu

63
lượt xem 2
download

Download Vui lòng tải xuống để xem tài liệu đầy đủ

Lecture Data Structures & Algorithms: Chapter 2 - Function & Recursion presented Function, the Concept Of Stack, the Sequence Of Execution During A Function Call, Parameter Passing & Call By Reference, Resolving Variable References, Recursion, Stack Overheads In Recursion, Writing A Recursive Function, Types Of Recursion.

Chủ đề:

Bình luận(0) Đăng nhập để gửi bình luận!

Lưu

Nội dung Text: Lecture Data Structures & Algorithms: Chapter 2

DONG NAI UNIVERSITY OF TECHNOLOGY Data Structures & Algorithms 1
DONG NAI UNIVERSITY OF TECHNOLOGY Function & Recursion 2
1. Function DONG NAI UNIVERSITY OF TECHNOLOGY 2. The Concept Of Stack 3. The Sequence Of Execution During A Function Call 4. Parameter Passing & Call By Reference 5. Resolving Variable References 6. Recursion 7. Stack Overheads In Recursion 8. Writing A Recursive Function 9. Types Of Recursion 3
DONG NAI UNIVERSITY OF TECHNOLOGY 1. FUNCTION – Provide modularity to the software – Divide complex tasks into small Manageable tasks – Avoid duplication of work 4
DONG NAI UNIVERSITY OF TECHNOLOGY int sumOfArray(int M[] , int n) { int nSum=0; for(int i=0;i
DONG NAI UNIVERSITY OF TECHNOLOGY 2. THE CONCEPT OF STACK – A stack is memory in which values are stored and retrieved in "last in first out" manner by using operations called push and pop. 6
DONG NAI UNIVERSITY OF TECHNOLOGY 3. THE SEQUENCE OF EXECUTION DURING A FUNCTION CALL – When the function is called, the current execution is temporarily stopped and the control goes to the called function. After the call, the execution resumes from the point at which the execution is stopped. – To get the exact point at which execution is resumed, the address of the next instruction is stored in the stack. When the function call completes, the address at the top of the stack is taken. 7
DONG NAI UNIVERSITY OF TECHNOLOGY 3. THE SEQUENCE OF EXECUTION DURING A FUNCTION CALL – Functions or sub-programs are implemented using a stack. – When a function is called, the address of the next instruction is pushed into the stack. – When the function is finished, the address for execution is taken by using the pop operation. 8
DONG NAI UNIVERSITY OF TECHNOLOGY 9
DONG NAI UNIVERSITY OF TECHNOLOGY 4. PARAMETER * REFERENCE PASSING – passing by value • the value before and after the call remains the same – passing by reference • changed value after the function completes 10
DONG NAI UNIVERSITY OF TECHNOLOGY N=5 N=8 N=5 (Method) Passing by value N=5 N=8 N=8 (Method) Passing by reference 11
void func1(int &n) DONG NAI UNIVERSITY OF TECHNOLOGY { n=n+10; } void func2(int *n) By Value ??? { By Reference??? *n=*n+10; } void func3(int n) { n=n+10; } 12
DONG NAI UNIVERSITY OF TECHNOLOGY 5. RESOLVING VARIABLE REFERENCES - When a variable can be resolved by using multiple references, the local definition is given more preference 13
DONG NAI UNIVERSITY OF TECHNOLOGY 6. RECURSION - A method of programming whereby a function directly or indirectly calls itself - Problems: stop recursion? 14
6. RECURSION DONG NAI UNIVERSITY OF TECHNOLOGY 15
6. RECURSION DONG NAI UNIVERSITY OF TECHNOLOGY 16
6. RECURSION DONG NAI UNIVERSITY OF TECHNOLOGY Hanoi tower 17
6. RECURSION DONG NAI UNIVERSITY OF TECHNOLOGY 18
6. RECURSION DONG NAI UNIVERSITY OF TECHNOLOGY 19
DONG NAI UNIVERSITY OF TECHNOLOGY 7. STACK OVERHEADS IN RECURSION – Two important results: the depth of recursion and the stack overheads in recursion 20

CÓ THỂ BẠN MUỐN DOWNLOAD

THÔNG TIN

TRỢ GIÚP

HỖ TRỢ KHÁCH HÀNG

Theo dõi chúng tôi

Chịu trách nhiệm nội dung:

Nguyễn Công Hà - Giám đốc Công ty TNHH TÀI LIỆU TRỰC TUYẾN VI NA

LIÊN HỆ

Địa chỉ: P402, 54A Nơ Trang Long, Phường 14, Q.Bình Thạnh, TP.HCM

Hotline: 093 303 0098

Email: support@tailieu.vn

Giấy phép Mạng Xã Hội số: 670/GP-BTTTT cấp ngày 30/11/2015 Copyright © 2022-2032 TaiLieu.VN. All rights reserved.