Notesale: Turn your study into money

Document Preview

Extracts from the notes are below, to see the PDF you'll receive please use the links above

---

Brief Data Structures Easy to Advanced
Before I start, I want to lay the foundation of some core concepts you will need
throughout these course
...

A data structure is a way of organizing data so that it can be used
efficiently
...

Another reason might be that they help us manage and organize our data in a
natural way
...

The point here is that the abstract data type only defines how a data structure
should behave, and what methods it should have
...
Big O only cares about what
happens when your input becomes arbitrarily large
...

•
•

Almost any mathematical expression containing n can be wrapped
around a big O
...
If it takes like quadratic time or cubic
time, then we say n raised to that power, it’s exponential
...
And
because they don't depend on n at all
...

Now let 's look at perhaps a more complicated example:
...
So what this algorithm does is it starts by making two pointers, one
at the very start in one at end of the array
...
If it
has found it or not, it discards one half of the
...
This is part one of two in the array videos
...
With arrays and pointers alone, I 'm pretty sure we can construct just
about any data structure
...


The access time for static array and a dynamic array is constant because of a
property that arrays are indexable
...
Inserting appending from a static array doesn't really make sense
...
It can not grow larger or smaller
...
array, this operation can cost up linear time
...

Currently, all the elements are distinct
...
Also remark that the very first element 44 is indexed , or positioned
at index of zero in the array , not one , zero
...
The confusing part is that mathematics is one based
while computer science is zero based
...
The size of an
array has to be greater than or equal to zero
...
Today we
're going to talk about singly and doubly linked lists one of the most useful data
structures out there
...

The last node always has a null reference to the next note
...
Singly linked lists only
contain a pointer to the next node
...
There
are trade offs
...




---