summaryrefslogtreecommitdiff
path: root/659/CH9/EX9.6/exm9_6.sci
blob: dc947e4213784a41ea5b1794b4f54dd81a61a0f7 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
//             Example 9.6 
//Write a program that uses a function to sort an array of integers.
funcprot(0);
function[x]=sort(m,x)          //Passing an array i.e. marks to function sort()
    for i=1:m                  // i repesents number of passes
        for j=2:m-i+1          // j represents number of comperision in each pass
            if(x(j-1)>=x(j)) then
                t=x(j-1);
                x(j-1)=x(j);
                x(j)=t;
            end
        end
    end
endfunction
marks=int16([40,90,73,81,35]);  //creating an array named marks of 5 integers
disp("Marks before sorting");
disp(marks);
x=sort(5,marks);                //calling sort() function
disp("Marks after sorting");
disp(x);