quick sorting Archives

February 11, 2023

Quick Sorting (Recursive and Non Recursive)

algorithms
stack
YASH PAL

Algorithm Quick sorting (Nonrecursive) QUICK(A, N, BEG, END, LOC) Here A is an array with N elements. Parameters BEG and END contain the boundary values of the sub-list of A to which this procedure applies. LOC keeps track of the position of the first element. A[BEG] of the sub list during the procedure. The local […]

October 8, 2022

Quick Sorting in C Programming

quick sorting
Sorting techniques
YASH PAL

QUICK SORTING: – Quick Sort is an algorithm that also likes to merge sort and uses the idea of divide and conquers. This algorithm finds the element that divides (splits) the array into halves in such a way that the elements in the left sub-array are less than and the elements in the right sub […]