summaryrefslogtreecommitdiff
path: root/260/CH8/EX8.2/8_2.sce
diff options
context:
space:
mode:
authorprashantsinalkar2017-10-10 12:27:19 +0530
committerprashantsinalkar2017-10-10 12:27:19 +0530
commit7f60ea012dd2524dae921a2a35adbf7ef21f2bb6 (patch)
treedbb9e3ddb5fc829e7c5c7e6be99b2c4ba356132c /260/CH8/EX8.2/8_2.sce
parentb1f5c3f8d6671b4331cef1dcebdf63b7a43a3a2b (diff)
downloadScilab-TBC-Uploads-7f60ea012dd2524dae921a2a35adbf7ef21f2bb6.tar.gz
Scilab-TBC-Uploads-7f60ea012dd2524dae921a2a35adbf7ef21f2bb6.tar.bz2
Scilab-TBC-Uploads-7f60ea012dd2524dae921a2a35adbf7ef21f2bb6.zip
initial commit / add all books
Diffstat (limited to '260/CH8/EX8.2/8_2.sce')
-rw-r--r--260/CH8/EX8.2/8_2.sce28
1 files changed, 28 insertions, 0 deletions
diff --git a/260/CH8/EX8.2/8_2.sce b/260/CH8/EX8.2/8_2.sce
new file mode 100644
index 000000000..63e3550c8
--- /dev/null
+++ b/260/CH8/EX8.2/8_2.sce
@@ -0,0 +1,28 @@
+//Eg-8.2
+//pg-367
+
+
+clear
+clc
+
+A = [1447.5 1434.2 1361 1365.4 1412.7 1347.9 1382.8 1406.4 1365.1];
+n = length(A);
+printf('The given array is \n')
+disp(A)
+
+for(i=1:n)
+
+ for(i=1:n-1)
+ if(A(i) > A(i+1))
+ t = A(i);
+ A(i) = A(i+1);
+ A(i+1) = t;
+ end
+ end
+end
+
+
+printf('\n\nThe array after arranging in ascending order using bubble-sort algorithm is\n')
+disp(A)
+
+printf('Therefore the minimum and maximum values are %f and %f respectively\n',A(1),A(n)) \ No newline at end of file