// Even or Odd
// Constant Time O(1)


// Are you here?
// O(n*k) Linear || This was wrong -> should have been O(n^2)

// O (n)

//Naive Search O(n)

// Creating Pairs
// O(nlog(n)) || This was wrong -> Should have been O(n^2)

// Fibonachi O(n)

// Efficient Search (binary)
// O(log(n))

// Rando Element
// O(1)

// Is it prime
// O(n)