A public repository of some of the materials of the CISC320 Spring 2021 AlgoTutorBot Adventure

This project is maintained by acbart

- Watch the video below.
- You will not need to join the Ohyay workspace today.
- This assignment will be an
**individual**submission - You will submit your
**Algorithm Flowchart and Application PDF**to**GradeScope**for this assignment.

Today, you will be revising your flowchart. Then, you will solve another algorithmic problem.

Return to the Algorithmic Flowchart that you created two weeks ago (“Lesson 08- Algorithm Flowchart”). Update and improve on your Flowchart as you see fit. We expect you to make improvements based on specific strategies and ideas that we have conveyed over the past couple weeks. This flowchart is a reflection of what you have learned about solving problems. Demonstrate to us that you have more strategies.

**Problem:** Design (and clearly explain) an algorithm to find the second largest element
in an unsorted array. Your algorithm should use
`n + O(log(n))`

comparisons of elements on an array of size `n`

.
You may use `O(n)`

space as well.

Apply your algorithmic flowchart. Remember, you should be taking a break BEFORE you use any external resources in solving this problem. You also need to include a reflection as part of your solution.

Upload the following to GradeScope: https://www.gradescope.com/courses/230699/assignments/1078617/

- The latest version of your Algorithmic Flowchart
- Everything you wrote down while solving the problem (including reflections)

All files should be in PDF format.