document.write( "Question 307272: Z W Y X\r
\n" );
document.write( "\n" );
document.write( "The sequence above may be changed in either of two ways . either two adjacent letters may be interchanged or the entire sequence may be reversed . what is the least number of such changes needed to put the letters into alphabetical order from left to right ?\r
\n" );
document.write( "\n" );
document.write( "(A) 2 (B) 3 (C) 4 (D) 5 (E) 6\r
\n" );
document.write( "\n" );
document.write( " \n" );
document.write( "
Algebra.Com's Answer #219847 by Theo(13342)![]() ![]() You can put this solution on YOUR website! I would say 3 is the least number of manipulations.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "You start with zwyx\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "You reverse the whole string to get xywz\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "You reverse yw to get xwyz\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "You reverse xw to get wxyz\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Not it's in order.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "I don't think you can do better than that.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Answer would be selection B. \n" ); document.write( " |