Data Structures & Algorithms #1
What Are Data Structures?
There are a few different options for this one of those options will be to store all
possible paths in a list-like format. Data structures are two different ways of storing
the same set of data and as you can see they have sort of different structures and
so these are simplified examples of what data structures look like now if you're
already familiar with data structures you might notice that the first method
corresponds to the array or a list data structure. The second method is the hash
table or hash map data structure so what are algorithms one way to define what
they are would be that there are operations we can perform on different data
structures. An algorithm is you have a problem you're going to solve in this case
finding the shortest path from home to school and then you have systematic
instructions for solving that problem. Depending on what data structure you're
using to store the data that you're performing the algorithm on your algorithm
might look slightly different you might even have in some cases completely
different algorithms for solving the same problem.
Each person who comes to the party will bring sort of a small ball with them like a
ball that can fit in their hand and this ball will have their name written on it. David
will have a ball with David written on the ball and Kevin will have another ball with
Kevin written on them. This is a data structure that's realized in real life and this
corresponds to the data structure called array in computer science. To find in the
98th person or finding the 98th box here would be much harder than the linked list
1
What Are Data Structures?
There are a few different options for this one of those options will be to store all
possible paths in a list-like format. Data structures are two different ways of storing
the same set of data and as you can see they have sort of different structures and
so these are simplified examples of what data structures look like now if you're
already familiar with data structures you might notice that the first method
corresponds to the array or a list data structure. The second method is the hash
table or hash map data structure so what are algorithms one way to define what
they are would be that there are operations we can perform on different data
structures. An algorithm is you have a problem you're going to solve in this case
finding the shortest path from home to school and then you have systematic
instructions for solving that problem. Depending on what data structure you're
using to store the data that you're performing the algorithm on your algorithm
might look slightly different you might even have in some cases completely
different algorithms for solving the same problem.
Each person who comes to the party will bring sort of a small ball with them like a
ball that can fit in their hand and this ball will have their name written on it. David
will have a ball with David written on the ball and Kevin will have another ball with
Kevin written on them. This is a data structure that's realized in real life and this
corresponds to the data structure called array in computer science. To find in the
98th person or finding the 98th box here would be much harder than the linked list
1
