I wanted to know something about selection and Time complexity,for example if I had the f.f.g java code:public List<String> sort(int n, List<String> ob){ if(n == 1){    return binarySort(ob) else{    return selectionSort(ob)}I know this is a weird example but I feel it should help me understand what to do when you have selection at the extreme.How does one go about finding the big oh of the algorithm above? Please note you don't have to go into detail of explaining how big oh found for binary and selection sort.
Big Oh notation and selection
algorithm analysis;runtime analysis