Summary introduction to data structures and algorithm

Data Structures and Algorithms for Beginners
Programming with Mosh

THIS NOTE IS FOR THE( VEDIO DATA STRUCTURES AND
ALGORITHMS FOR BEGINNERS) FROM THE YOUTUBE CHANNEL
PROGRAMMING WITH MOSH

In this video we talk about the basics of data
structures and algorithms. We use the Big O
notation to describe the performance of an
algorithm. This helps us determine if a given
algorithm is scalable or not which basically means
is this algorithm going to scale well as the input
grows really large. Just because your code
executes quickly on your computer does not mean
it’s going to perform well when you give it a large
data set. Using the Big O notation to describe the
performance of our algorithms we 're going to
look at code snippets and use it to describe
performance of algorithms. Over the next few
videos, we ''re going to talk about how scalable an
algorithm is and finally knowing Big L will make
you a better developer or software engineer. The
algorithm is the algorithm that we use for printing
all combinations of items in an array. here we 're
using a traditional for loop we could also use a for
each loop for example for int number in numbers