DSA
unsorted/sorted list
linear search
it's stop when is found or in the end of an array
linear search
what is the advantage of linear search
simple & very easy to understand
does not require the data in the array to be stored in any particular order
what is disadvantage of linear search
very poor efficiency
slower than other searching algorithms
what is the best case of linear search
first element
what is the worst case of linear search
last element
what is the average case of linear search
middle or somewhere in the array
it is sorted list and only works if the array is already sorted
binary search
binary search is general term for what
smart search
what is first iteration
whole array
what is the 2nd iteration
half array
what is the 3rd iteration
quarter array
what binary search best case
middle element
refers to operation of arranging set of data in a given order
sorting
what are the two basic types of sorting
internal sorting & external sorting
all the data stored and adjusted in main memory then it's called
internal sorting
all the data stored is large and aquire external memory then it's called
external sorting
what are the three methods of sorting
bubble sort, selection sort, insertion sort
it is repeated until the list is sorted/arrange in ascending order
bubble sort
it's a simple sorting repeatedly selecting element to unsorted portion to sorted portion like find the smallest and put in the place
selection sort
it's effective when dealing small numbers and uses a mathematical. pushing a bigger number to the end of the array
insertion sort