昨天写了个排序算法，记录一下
-----------------------------------------------------------------------------------------
DECLARE
TYPE mylist_type IS TABLE OF NUMBER
INDEX BY PLS_INTEGER;
TYPE mylist_type IS TABLE OF NUMBER
INDEX BY PLS_INTEGER;
mylist mylist_type;
n_temp NUMBER;
BEGIN
n_temp NUMBER;
BEGIN
mylist (0) := 3;
mylist (1) := 2;
mylist (2) := 1;
mylist (3) := 4;
mylist (4) := 0;
mylist (1) := 2;
mylist (2) := 1;
mylist (3) := 4;
mylist (4) := 0;
FOR i IN REVERSE 0 .. mylist.COUNT - 1
LOOP
FOR j IN 1 .. i
LOOP
IF mylist (j-1) <= mylist (j)
THEN
n_temp := mylist (j-1);
mylist (j-1) := mylist (j);
mylist (j) := n_temp;
END IF;
END LOOP;
LOOP
FOR j IN 1 .. i
LOOP
IF mylist (j-1) <= mylist (j)
THEN
n_temp := mylist (j-1);
mylist (j-1) := mylist (j);
mylist (j) := n_temp;
END IF;
END LOOP;
DBMS_OUTPUT.put_line ('mylist (' || i || ')' || '=' || mylist (i));
END LOOP;
END;
/
END LOOP;
END;
/
mylist (4)=0
mylist (3)=1
mylist (2)=2
mylist (1)=3
mylist (0)=4
来自 “ ITPUB博客 ” ，链接：https://blog.itpub.net/13726712/viewspace-707908/ ，如需转载，请注明出处，否则将追究法律责任。
请登录后发表评论
登录
全部评论
