Heads up! To view this whole video, sign in with your Courses account or enroll in your free 7-day trial. Sign In Enroll
Well done!
You have completed Introduction to Algorithms!
You have completed Introduction to Algorithms!
Preview
In this video we look at how we can determine the runtime of algorithms we write
This video doesn't have any notes.
Related Discussions
Have questions about this video? Start a discussion with the community and Treehouse staff.
Sign upRelated Discussions
Have questions about this video? Start a discussion with the community and Treehouse staff.
Sign up
how do we determine what the worst
case complexity of an algorithm is?
0:00
Earlier I mentioned that even
though we say that an algorithm has
0:03
a particular upper bound or
worst case run time,
0:07
each step in a given algorithm
can have different run times.
0:10
[SOUND] Let's bring up the steps for
binary search again.
0:13
Assuming the list is sorted,
0:17
the first step is to determine
the middle position of the list.
0:19
In general, this is going to
be a constant time operation.
0:23
Many programming languages hold on to
information about the size of the list, so
0:26
You need to sign up for Treehouse in order to download course files.
Sign upYou need to sign up for Treehouse in order to set up Workspace
Sign up