Position of prime in n fixed search
 

When you do n fixed search for prime , from beginning to the end has only small difference is digit length.
And since prime can be anywhere in range what type of search will "produce" better chance for faster finding prime
[LIST=1][*] search from start to the end[*]search in random order[/LIST]