STORED PROCEDURE THAT COMPUTES THE GREATEST OF THE NUMBERS IN ORACLE?.



SQL> CREATE OR REPLACE FUNCTION BIG(A NUMBER, B  
  NUMBER, C NUMBER)RETURN NUMBER AS
  2 BEGIN
  3 IF(A>B AND A>C)
  4 THEN RETURN A;
  5 ELSIF (A<B AND B>C) THEN
  6 RETURN B;
  7 ELSE
  8 RETURN C;
  9 END IF;
 10 END BIG;
 11 /
 Function created.

SQL> SELECT BIG (14,20,50) FROM DUAL;
BIG(14,20,50)
  -------------
        50
PL/SQL procedure successfully completed.

SQL> START GREATEST.SQL;
 Function created.
SQL> SELECT BIG (4,8,20) FROM DUAL;
BIG(4,8,20)
  -------------
        20
PL/SQL procedure successfully completed.

Comments

Post a Comment

Popular posts from this blog

Write a program to add two number using inline function in C++?

#include<iostream.h> #include<conio.h> class bca {   public:   inline int sum(int x, int y)   {   return(x+y);   } }; int main() { clrscr(); int r,a,b; bca obj; cout<<"enter two integers :"<<endl; cin>>a>>b; r=obj.sum(a,b); cout<<" the sum of two integers is :"<<r<<endl; getch(); return 0; }   OUTPUT:- enter two integers :    3    6 the sum of two integer is :   9  
Read more

Traversing of elements program with algorithm and Flowchart

Image
ALGORITHM VARIABLES: §   i:      loop counter of array. §   A:    array name. §   LB: lower bound. §   UB: upper bound. ALGORITHM: STEP 1:         set i =LB STEP 2:         repeat steps 3 & 4                            While i<=UB STEP 3:         apply process to A[i] STEP 4:         i = i+1            STEP 5:         exit EXPLANATION: §   To traverse the elements of the array, firstly set the loop counter ‘i’ equal to last element of the array called the LOWER BOUND. §   Now, repeat step 3 & 4 for accessing all the elements of the array until loop counter ‘i’ is not less than or equal first element of array. §   Now, after checking the above condition, the whole process will repeat for all the elements of array. §   After applying process upon a[i], increment the loop counter by 1, until the condition is not satisfied. IMPLEMENTATION
Read more