Question

Hello, I need help with the function below, The language I am using is Ocaml

open Printf

let () =
   for i = 1 to Array.length Sys.argv - 1 do
if i + 1 <> Array.length Sys.argv then
(
   if Sys.argv.(i) > Sys.argv.(i+1) then
   (
--> printf "%s\n" Sys.argv.(i+1);

   )

       else printf "%s\n" Sys.argv.(i);
   )
  
   else printf "%s\n" Sys.argv.(i)
  
done;;

the function is taking command arguments and print them in order. It's taking sting. this is my kind solution but I have one problem. if I print args(i+1) then argue(i) will never get printed. I need a way to swap (i+1) with (i), where I point the arrow, if (i+1) printed first. Thank you. Please explain.

Answer 1

Hi,

I will try to answer this question with equivalent Java Code. I will explain the steps. In order to get the output in ascending order we have to sort the elements. You can solve the above question by using two for loops instead of one. Look at the following java code

String args[]={"a","c","d","b","e"};

for(int i=0;i<args.length;i++){

for(int j=0;j<args.length-i-1;j++){

int result=args[j].compareTo(args[j+1]);//Here the elements will be compared with the next element. If args[j] >args[j+1] then result will be positive.If args[j] < args[j+1] then result will be negative. if they are equal then result will be 0.

if(result>0){ // for integer array you can use directly, if( args[j]> args[j+1]), then we need to swap these two

// logic to swap two variables

String temp=args[j];

args[j]=args[j+1];

args[j+1]=args[j];

}

}

for(int i=0;i<args.length;i++)

System.out.println(args[i]);// printing the ascending ordered array i.e., a,b,c,d,e

}

Now, we have to apply the same logic in your question as well.

let () =
   for i = 1 to Array.length Sys.argv - 1 do

for j=1 to Array.length Sys.argv-i-1 do

if Sys.argv.(j) > Sys.argv.(j+1) then
   (

//Swaping the two variables

let temp=Sys.argv.(j);

Sys.argv.(j+1)=Sys.argv.(j);

Sys.argv.(j)=temp;
   )

  

for i=1 to Array.length Sys.argv-1 do

printf "%s\n" Sys.argv.(i)
  

Hope that answers the question. Thank You