Consider an array of any given unique integers e.g. [1,3,2,4,6,5] how would one determine
the level of “sortedness”, ranging from 0.0 to 1.0 ?
Consider an array of any given unique integers e.g. [1,3,2,4,6,5] how would one determine
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Consider an array of any given unique integers e.g. [1,3,2,4,6,5] how would one determine
the level of “sortedness”, ranging from 0.0 to 1.0 ?
I would say the number of swaps is not a very good way to determine this. Most importantly because you can sort the array using a different number of swaps. In your case, you could switch 2<–>3 and 6<–>5, but you could also do a lot more switches.
How would you sort, say:
Would you directly switch 2 and 4, or would you switch 3 and 4, then 4 and 2, and then 3 and 2.
I would say a more correct method would be the number of elements in the right place divided by the total number of elements.
In your case, that would be 2/6.