Doubt in Week 4 Activity 3 Q3

[Shambhavi Singh]

The question is, "as mentioned in the lecture, assume that a computer can do 10^8 comparisons in a second. How many seconds will it take for the computer to do pairwise comparisons of one million (1, 000, 000) elements?"

The correct answer happens to be nearly 5000 seconds.

I didn't understand how it is calculated.

1, 000, 000 is 10^6 which is less than 10^8 so the answer according to me should be less than 1 second.

Can someone kindly explain the method used in solving this question.

Would be very helpful.

Thank you.

[Goutam Basu]

{1000000x(1000000-1)/2}/100000000=4999.995

--
You received this message because you are subscribed to the Google Groups "Discussion forum for Computational Thinking" group.
To unsubscribe from this group and stop receiving emails from it, send an email to cs1001-discus...@nptel.iitm.ac.in.
To view this discussion on the web visit https://groups.google.com/a/nptel.iitm.ac.in/d/msgid/cs1001-discuss/03b0761c-bf48-440f-926f-e82d12759308n%40nptel.iitm.ac.in.

[Shambhavi Singh]

Thank you so much for the explanation :)

[Anand Iyer]

Lavanya, How many zeros are there in 10^2?  What about 10^3?  think from there...

On Wednesday, November 18, 2020 at 9:26:47 PM UTC+5:30 lavany...@gmail.com wrote:

shouldn't we divide it by 10^8 (9 zeroes) ? 

[Lavanya S]

oops!! yeah sorry