Skip to content

Add saiteja ambati's data #1797

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Add saiteja ambati's data #1797

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 6 additions & 0 deletions Course3
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,3 +9,9 @@ Pawan Dubey
Dynamic Programming
Understanding the prolem and implementing a solution which is space and time efficient by structuring it into sub problems.

Sai Teja Ambati
Algorithm Analysis
Algorithm analysis is the process of determining the amount of resources, such as time and space, that an algorithm requires.
It helps in understanding the efficiency and scalability of an algorithm.
Key techniques include analyzing the worst-case, average-case, and best-case scenarios.
This allows for the comparison of algorithms to select the most suitable one for a specific task.