Member Avatar for Om

What is the step count for this in terms of n ?

SequentialSearch(a,x,n)
{
i=n;
a [0]=x;
while(a [i]!= x) do
i = i-1
return i
}
  • 2 Contributors
  • 1 Reply
  • 135 Views
  • 2 Hours Discussion Span
  • Latest Post Latest Post by TrustyTony
Member Avatar for TrustyTony

What is your problem, looks simple enough and I think you should be finding average or worst case behaviour complexity in O notation.

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.