Scribd
Upload
2 views

Python Assignment 3

This document outlines a practice assignment focused on algorithms and problem-solving, with a duration of 2 hours. It consists of two main tasks: creating pseudocode and a flowchart for a bubble sort algorithm, and writing a recursive function for calculating the nth Fibonacci number while analyzing its efficiency. The assignment encourages comparison between recursive and iterative approaches regarding space and time complexity.

Uploaded by

rmanimaran911
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Python Assignment 3

This document outlines a practice assignment focused on algorithms and problem-solving, with a duration of 2 hours. It consists of two main tasks: creating pseudocode and a flowchart for a bubble sort algorithm, and writing a recursive function for calculating the nth Fibonacci number while analyzing its efficiency. The assignment encourages comparison between recursive and iterative approaches regarding space and time complexity.

Uploaded by

rmanimaran911
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Practice Assignment – 3

Algorithms and Problem-Solving

Techademy
CONTENTS
1 Duration .......................................................................................................................................... 2
2 Problem Statements ....................................................................................................................... 2
2.1 Task 1: Pseudocode and Flowchart for Sorting Algorithm...................................................... 2
2.2 Task 2: Recursive Function and Efficiency Analysis ................................................................ 2

1
1 DURATION
2 Hours

2 PROBLEM STATEMENTS

2.1 Task 1: Pseudocode and Flowchart for Sorting Algorithm


Write pseudocode and create a flowchart for a bubble sort algorithm. Provide a brief
explanation of how the algorithm works and a simple array of integers to demonstrate a
dry run of your algorithm.

2.2 Task 2: Recursive Function and Efficiency Analysis


Write a recursive function pseudocode and calculate the nth Fibonacci number and use
Big O notation to analyze its efficiency. Compare this with an iterative approach and
discuss the pros and cons in terms of space and time complexity.

You might also like