How to resolve the algorithm Sorting algorithms/Stooge sort step by step in the PL/I programming language

Published on 12 May 2024 09:40 PM
#Pl/i

How to resolve the algorithm Sorting algorithms/Stooge sort step by step in the PL/I programming language

Table of Contents

Problem Statement

Show the   Stooge Sort   for an array of integers.

The Stooge Sort algorithm is as follows:

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Sorting algorithms/Stooge sort step by step in the PL/I programming language

Source code in the pl/i programming language

stoogesort: procedure (L) recursive; /* 16 August 2010 */
   declare L(*) fixed binary;
   declare (i, j, t, temp) fixed binary;

   j = hbound(L,1);
   do i = lbound(L, 1) to j;
     if L(j) < L(i) then
         do; temp = L(i); L(i) = L(j); L(j) = temp; end;
     if j - i > 1 then
         do;
            t = (j - i + 1)/3;
            call stoogesort(L, i  , j-t);
            call stoogesort(L, i+t, j  );
            call stoogesort(L, i  , j-t);
         end;
   end;
end stoogesort;

You may also check:How to resolve the algorithm Strip comments from a string step by step in the EasyLang programming language
You may also check:How to resolve the algorithm String concatenation step by step in the C programming language
You may also check:How to resolve the algorithm Chat server step by step in the Haskell programming language
You may also check:How to resolve the algorithm Jacobsthal numbers step by step in the FreeBASIC programming language
You may also check:How to resolve the algorithm Thue-Morse step by step in the Factor programming language