Write an algorithm to find out the smallest number in an unsorted list

How can I apply this python code wherein I have an input n. Then create a list from 2, n and remove the multiples of n. Example: Input: 10 Output: 2, 3, 4, 5, 6, 7, 8, 9 def createList(n):    #Base Case/s    #TODO: Add conditions here for your base case/s    #if <condition> :        #return <value>      #Recursive Case/s    #TODO: Add conditions here for your recursive case/s    #else:        #return <operation and recursive call>     #remove the line after this once you've completed all the TODO for this function    return [] def removeMultiples(x, arr):      #Base Case/s    #TODO: Add conditions here for your base case/s    #if <condition> :        #return <value>      #Recursive Case/s    #TODO: Add conditions here for your recursive case/s    #else:        #return <operation and recursive call>     #remove the line after this once you've completed all the TODO for this function    return []

Performing sequential search for an item that is not present in an unsorted list has Best-Case running time equals to:           1     log(n)     n     n2

Write a Python program to create a list by asking the user the list size and listelements. Remove all duplicates elements from a list. : Let’s the input list is- A= [4, 7, 9, 12, 32, 4, 67, 9], output will be [7, 12, 32, 67]

Program to  Reverse a string by using recursion.  Plz add comments. Reply fast.