Oracle PL/SQL – DROP FUNCTION Statement This article will help you to understand “Oracle PL/SQL – DROP FUNCTION Statement” with example and description. The DROP FUNCTION statement drops a standalone stored function from the database. Example 1. DROP function example Here first we will create function get_current_month. Then we will DROP it using DROP FUNCTION […]
Oracle PL/SQL – ALTER FUNCTION Statement This article will help you to understand “Oracle PL/SQL – ALTER FUNCTION Statement” with example and description. Oracle PL/SQL – ALTER FUNCTION statement explicitly recompiles a standalone function. Sometimes because of ALTER TABLE on table being used in function, the function becomes INVALID. We can check the status of […]
Oracle PL/SQL – Create Function Example This article will help you to understand “Oracle PL/SQL – Create Function” with examples and description. Oracle PL/SQL – CREATE FUNCTION statement is used to create user defined function. It’s also known as stored function or user function. User defined functions are similar to procedures. The only difference is […]
Towers Of Hanoi Algorithm The towers of hanoi is a mathematical puzzle. We have three towers (or rods or pegs), and a number of disks of different sizes which can slide into any tower. The puzzle starts with the disks on one tower in ascending order of size, the smallest at the top, making a […]
Selection Sort Algorithm Selection sort is a sorting algorithm, specifically an in-place comparison sort. It has O(n2) time complexity, making it inefficient on large lists, and generally performs worse than the similar insertion sort. Selection sort is noted for its simplicity, and it has performance advantages over more complicated algorithms in certain situations, particularly where […]
Quick Sort Algorithm Quick sort (sometimes called partition-exchange sort) is an efficient sorting algorithm. It is a commonly used algorithm for sorting. When implemented well, it can be about two or three times faster than its main competitors, merge sort and heap sort. Quick sort is a divide and conquer algorithm. Quick sort first divides […]
Merge sort algorithm is an efficient, comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output. Merge sort is a divide and conquer algorithm that was invented by John von Neumann in 1945. Conceptually, a merge sort works as follows: […]
Insertion Sort Algorithm Insertion sort algorithm is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort. This works like the way we sort playing cards in our hands. […]
Linear or Sequential Search Algorithm Linear or sequential search algorithm is a method for finding a target value within a list. It sequentially checks each element of the list for the target value until a match is found or until all the elements have been searched. For a list with n items, the best case […]
Bubble Sort Algorithm Bubble sort algorithm, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which […]