Back to General discussions forum
Hi!, I've been working in bogosort but I get stuck in problem that I can't identify, in example that is given in the problem, the last entry has to get an output equal to 1391 however for any reason I'm getting 1215 and not only that, my solution may find in few iteration the correct order for each entry in example and only the second entry give me a correct output other ones are bad.
To give an example of the value j that i get (j = r % n -> Where r in random value and n is length of entry) for this entry
Seed for random 918255
Entry : [102 81 128 168 56 145 27]
I got this:
0 0 4 2 5 0 3 6 6 0 6 0 0 3 4 2 3 0 1 2 3 0 2 3 1 3 5 5 6 6 2 4 0 0 2 6 0 1 6 1 2 4 5 4 6 4 1 6 3 1
6 0 4 4 2 3 5 6 6 0 2 4 0 1 3 4 6 6 6 6 0 4 6 3 0 1 6 0 1 0 3 0 5 0 0 1 6 5 0 3 1 1 6 2 4 1 1 2 0 0
1 1 6 2 3 5 5 6 5 3 4 1 3 2 6 6 5 0 1 6 2 5 4 1 1 0 0 2 4 1 2 5 5 4 2 4 6 3 1 6 1 0 1 6 1 1 0 0 4 0
3 6 6 6 1 6 3 3 2 3 4 6 5 6 0 1 0 2 5 4 6 0 1 3 5 0 0 1 0 0 1 3 5 3 5 3 1 0 1 6 2 0 2 3 2 2 3 4 2 4
1 6 0 0 6 3 0 0 4 4 0 3 5 0 1 6 0 0 0 1 6 6 0 1 0 4 4 1 0 3 1 3 2 5 4 2 0 3 3 4 2 6 2 5 3 0 2 4 6 2
0 1 1 2 4 5 0 1 2 5 4 5 3 6 2 3 5 5 3 0 3 6 6 6 5 3 0 3 2 3 6 1 0 1 4 4 6 0 1 5 6 2 0 1 1 2 0 0 0 3
5 6 3 1 1 1 6 6 6 5 3 1 0 4 6 0 4 0 2 3 1 3 4 5 5 2 4 2 5 4 1 5 3 6 5 5 3 6 5 4 0 3 0 6 0 2 3 1 2 a
That is only a short part of the output
I would like that someone compare its output with my output to know if my problem if here and if its possible share its output to can debug my code, Thnx!
I found the error, it's necessary complete each "for cycle" of 7 steps to check if the array is already sorted