diff options
| author | prashantsinalkar | 2017-10-10 12:38:01 +0530 |
|---|---|---|
| committer | prashantsinalkar | 2017-10-10 12:38:01 +0530 |
| commit | f35ea80659b6a49d1bb2ce1d7d002583f3f40947 (patch) | |
| tree | eb72842d800ac1233e9d890e020eac5fd41b0b1b /37/CH7 | |
| parent | 7f60ea012dd2524dae921a2a35adbf7ef21f2bb6 (diff) | |
| download | Scilab-TBC-Uploads-f35ea80659b6a49d1bb2ce1d7d002583f3f40947.tar.gz Scilab-TBC-Uploads-f35ea80659b6a49d1bb2ce1d7d002583f3f40947.tar.bz2 Scilab-TBC-Uploads-f35ea80659b6a49d1bb2ce1d7d002583f3f40947.zip | |
updated the code
Diffstat (limited to '37/CH7')
| -rwxr-xr-x | 37/CH7/EX7.2/s2.sci | 41 | ||||
| -rwxr-xr-x | 37/CH7/EX7.3/s3.sci | 42 |
2 files changed, 37 insertions, 46 deletions
diff --git a/37/CH7/EX7.2/s2.sci b/37/CH7/EX7.2/s2.sci index a8638db30..3406b80cf 100755 --- a/37/CH7/EX7.2/s2.sci +++ b/37/CH7/EX7.2/s2.sci @@ -1,25 +1,16 @@ -function[]=sortedsearch(a,n,ele)
- if(a(1)>ele|a(n)<ele)
- disp("NOT IN THE LIST");
- else
- i=1;
- j=0;
- for i=1:n
- if(a(i)==ele)
- printf("FOUND %d AT %d",ele,i);
- j=1;
- else
- if(a(i)>ele)
- break;
- end
- end
- end
- if(j==0)
- disp("%d NOT FOUND",ele);
- end
- end
-endfunction
-//Calling Routine:
-a=[2 22 23 33 121 222 233]//a should be sorted
-disp(a,"Given array");
-search(a,7,23)
+function[]=sortedsearch(a,n,ele) + if(a(1)>ele|a(n)<ele) disp("not="" in="" the="" list");="" else="" i="1;" j="0;" for="" if(a(i)="=ele)" printf("found="" %d="" at="" %d",ele,i);="">ele) + break; + end + end + end + if(j==0) + disp("%d NOT FOUND",ele); + end + end +endfunction +//Calling Routine: +a=[2 22 23 33 121 222 233]//a should be sorted +disp(a,"Given array"); +sortedsearch(a,7,23) +</ele)>
\ No newline at end of file diff --git a/37/CH7/EX7.3/s3.sci b/37/CH7/EX7.3/s3.sci index 1fdc4203a..0ef82927c 100755 --- a/37/CH7/EX7.3/s3.sci +++ b/37/CH7/EX7.3/s3.sci @@ -1,21 +1,21 @@ -function[]=binsearch(a,n,i)
- l=1;
- h=n;
- while(l<=h)
- mid=int((l+h)/2);
- if(a(mid)==i)
- printf("FOUND %d AT %d",i,mid);
- break;
- else
- if(a(mid)>i)
- h=mid-1;
- else
- l=mid+1;
- end
- end
- end
-endfunction
-//Calling Routine:
-a=[2 22 23 33 121 222 233]//a should be sorted
-disp(a,"Given array");
-search(a,7,23)
\ No newline at end of file +function[]=binsearch(a,n,i) + l=1; + h=n; + while(l<=h) + mid=int((l+h)/2); + if(a(mid)==i) + printf("FOUND %d AT %d",i,mid); + break; + else + if(a(mid)>i) + h=mid-1; + else + l=mid+1; + end + end + end +endfunction +//Calling Routine: +a=[2 22 23 33 121 222 233]//a should be sorted +disp(a,"Given array"); +binsearch(a,7,23)
\ No newline at end of file |