Take the best for get the rest (Algorithm)

The take the best Algorithm is a model used for fast and quick analysis with limited knowledge with the view of take the best and for get the rest. this module has 5steps is use's before it in turn comes to its final decision.

The first step that the module adopts is to choose any object that is recognised when selecting out of the two. Where as if neither of the two objects are recognised then choose randomly, but if both of the objects are recognised then proceed onto step two.

The second step the model adopts once you have both of the objects then you retrieve the cue vales of the objects with the highest ranking of cue memory.

The third step of the Algorithm is to decide if the cue discriminates or not. Providing that both values are the same the cue isn't known to discriminate unless one has a positive value and the other doesn't.

Step four of the model is to then search for the discrimination as if the cue doesn't discriminate the your advised to go back to step two until the discrimination is found. If the cue is found to discriminate then proceed on to the final step

The final step used by the model is to then choose the cue that has a positive value, but if no cue discriminates then your advised to choose randomly.

For example if we are trying to figure out which city is larger city a or b for the first step we would have to have both cities recognised. Step two would be then to search for the best cue results with a positive and negative value. Step three is then to see if the cue value then discriminates if it dose then you would move onto step four where the search would stop and from here the person would make the assumption that city a rather than b is larger than a which is the step Five as the final decision has been made.