.idea/**

pychache__/**

**/pychache__/**

Algorithms have associated complexity:

* space -> memory occupied

* time -> time taken to complete task irrespective of input size

* They have set of input and produces output

#Algorithms classification

* series-> sequential fashion

* parallel -> break data set and work on each simultaneously

* exact -> provides exact value as output

* approximate -> output may or may not be exact e.g. face recognition

* deterministic -> steps know

* non-deterministic -> based on guesses

* searching -> search specific data in a larger data

* sorting -> sort a dataset

* computational -> take one data set and return another data set

* collection -> navigating through elements in a dataset

Big-O notation: classifies performance as input size grows. O represents order of operation

<table>

<tr>

<th>Notation</th>

<th>Description</th>

</tr>

<tr>

<td>O(1)</td>

<td>Constant</td>

</tr>

<tr>

<td>O(log n)</td>

<td>Logarithmic</td>

</tr>

<tr>

<td>O(n)<br></td>

<td>Linear time</td>

</tr>

<tr>

<td>O(nlogn)</td>

<td>Log-linear</td>

</tr>

<tr>

<td>O(n^2)</td>

<td>Quadratic</td>

</tr>

</table>

def gcd(a, b):

while b != 0:

t = a

a = b

b = t % b

return a

if __name__ == '__main__':

print(gcd(60, 96))

print(gcd(20, 8))