Hi there Summer 112!
2.5 divided by 4.75 is 0.526315789473684. Hope this helps!
Since the sequence is sorted, you can use the binary search, which is of O(lg2). You can google binary search, or inspire from the following.
Basically, the algorithm looks like the following:
checkMiddle(ai, a1,n)
if (n==0) return(-1) // key ai not found
k=(1+n)/2;
if (a_k = ai) return(k)
else
if (a_k>ai
checkMiddle(ai,a_1,k)
else
checkMiddle(ai,a_(k+1),n-k)
endif
You may have to tune and check, but the basic idea is there.
Also, concerning computing algorithms, you are better off with posting it under technology and computers.
I can try what exactly do you need help with
Answer:
A
Step-by-step explanation:
point H is the point of intersection of the perpendicular bisectors of the triangle's sides and is the circumcentre.