f(n)= 1.Pn + 2.Pn + 3.Pn +...+ N.Pn where Pn = 1/N f(n)= 1.1/

What is the average number of comparisons in a sequential
search?

Question Posted / vivek tiwari

Answer Posted / vivek tiwari

f(n)= 1.Pn + 2.Pn + 3.Pn +...+ N.Pn
where
Pn = 1/N
f(n)= 1.1/N +2.1/N + 3.1/N+....+N.1/N
= (1+2+3+....+N)1/N
= N(N+1)/2N
= (N+1)/2

Is This Answer Correct ?

47 Yes

1 No

Please Help Members By Posting Answers For Below Questions

Which type of sorting is best?

939

What is ascii sort order?

916

Define a stack?

1081

How many null values are allowed in hashmap?

930

Define separate chaining?

965

What does a bubble chart show?

913

How can you implement a stack?

1083

What is data type with example?

957

Which sorting does collections sort use?

909

Which data structures are used in bfs and dfs algorithm?

1051

What is the difference between the hash table and hash map?

1018

Does linkedhashset allow null values?

1008

What do you know about traversal in linked lists?

937

How many types of data structure are there?

892

Which type of memory allocation is referred for linked list?

1195