Scribd
Upload
22 views

Algorithm

Algorithm analysis

Uploaded by

Aimee Hernandez
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
22 views

Algorithm

Algorithm analysis

Uploaded by

Aimee Hernandez
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

I.

TOPICS
A. Sorting Algorithms:
 Bubble Sort
 Insertion Sort
 Merge Sort
B. Algorithm Design Techniques:
 Brute Force
 Divide and Conquer
 Decrease and Conquer
 Transform and Conquer
C. Time Complexity:
 Understanding the time complexity of different algorithms.
 Analyzing best, average, and worst-case scenarios.

II. OBJECTIVES
The students should be able to solve, analyze and explain the functionality
and steps of various sorting algorithms by choosing the appropriate algorithm
and design technique for a given task.

III. MATERIALS
 Pen and paper for written responses.
 Calculator (optional for complex time complexity calculations).

IV. DIRECTIONS
1. Each student will be performed a written task.
2. They will be picking topics in a box that will be written individually.
3. They will be described how to solve the topic that they’ve chosen.
4. The presentation will last for a maximum of 1 hour.
5. Please see attached rubrics for grading.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy