answersLogoWhite

0

When you're searching for something you are simply examining each entity, comparing them with another entity in order to locate a match. When you're sorting entities, you are re-arranging the order of those entities. In both cases you will perform a comparison between two entities at a time, the only real difference is that you do not re-arrange the entities when searching.

User Avatar

Wiki User

12y ago

What else can I help you with?

Related Questions

What is the difference between an algorithm and a flowchart in general?

Algorithm is step wise analysis of the work to be done. Flow chart is a pictorial representation of an algorithm. As flow chart is a picture of work to be done,it may be printed in our mind when we observe it.


What is the difference between AES Rijndael symmetric algorithm encryption and a hash algorithm?

678


What is the difference between heat and product analysis in steel Why should this be?

what is the difference between product analysis and heat analysis


What is difference between lemma and algorithm?

A Method that used to be a comouter to soultion of promlems is called algorithm.


Whats the difference between accounts analysis and engineering analysis?

what is difference between accounts and engineering


What is the difference between heat analysis and product analysis?

manufacturing process of steel plates difference between heat and product analysis ?


What is the manufacturing difference between product analysis and heat analysis?

manufacturing process of steel plates difference between heat and product analysis ?


What is the relationship between Big O notation and induction in algorithm analysis?

In algorithm analysis, Big O notation is used to describe the upper bound of an algorithm's time complexity. Induction is a mathematical proof technique used to show that a statement holds true for all natural numbers. In algorithm analysis, induction can be used to prove the time complexity of an algorithm by showing that the algorithm's running time follows a certain pattern. The relationship between Big O notation and induction lies in using induction to prove the time complexity described by Big O notation for an algorithm.


What is the difference between procedure and algorithm?

A procedure can go on forever.Where as an Algorithm, will eventually terminate and will have each step precisely defined.


Difference between greedy algorithm and dynamic programming?

the basic difference between them is that in greedy algorithm only one decision sequence is ever generated. where as in dynamic programming many decision sequences are generated.


The difference between a trend analysis and a comparative analysis?

Difference between e-resuming system of bdjobs and phrotom alo.com


Difference between Bresenham and midpoint circle drawing algorithm?

what is difference between mid-point and bresenhams circle algorithm what is difference between mid-point and bresenhams circle algorithm bresenhams circle algorithm results in a much more smoother circle,comparred to midpoint circle algorithm..In mid point,decision parameter depends on previous decision parameter and corresponding pixels whereas in bresenham decision parameter only depends on previous decision parameter...