Design an algorithm that when given an arrangement of thedigits 0,1,2,3,4,5,6,7,

Question

Design an algorithm that when given an arrangement of thedigits 0,1,2,3,4,5,6,7,8,9 rearranges the digits so that newarrangement represents the next larger value that can berepresented by those digits (or reports no such arrangements existsif no rearrangements produces a larger value. thus 5647382901 wouldproduce 5647382910. Design an algorithm that when given an arrangement of thedigits 0,1,2,3,4,5,6,7,8,9 rearranges the digits so that newarrangement represents the next larger value that can berepresented by those digits (or reports no such arrangements existsif no rearrangements produces a larger value. thus 5647382901 wouldproduce 5647382910.

Explanation / Answer

Dear, Algorithm :
Input : N unordered number digits
Output : Rearranged digits.
Methodology :
            If (the list is notempty) then
             (Longest <-- the first entry in the list;
              P <-- 2;
              while (P <= length of list) do
              (if (the Pth entry in the list is longer than Longest)
              then (Longest <-- the Pth entry);
              P <-- P + 1)

Note : If there are more than one longest entry, thisalgorithm reports the first one
I hope this is helpful for you......

Related Questions

Navigate

• Browse (All)
• Browse D
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.