The notation would be O (n-1) because there would be no need to compare with the first bit however this notation is most commonly noted as O (n) but the first is also technically correct
Answer:
log base 3a= -0.631.log a/3 base 3
Now, -log m= log 1/m
hence,
log base 3a= 0.631.log 3/a base 3
log base 3a/log 3/a base 3 =0.631
log base 3 ( a.3/a) =.631 since, log m/logn =log n(m)
log base 3 3=0.631
Hence, answer is log base 3 3=0.631
Explanation:
Please check the answer section.
Answer:
#include<iostream>
using namespace std;
main(){
cout<<"\*Computer Science is no more about computers \n than astronomy is about telescopes"<<endl;
}
Explanation:
using c++
Answer:
You have to have 2 answers on a question. When you find a question that is pretty reasonable, you should see a little yellow crown.
Explanation:
Practice on this if you need :D
