Skip to content

DSA

  • Algorithms
  • DSA
  • Array
  • Stack
  • Queue
  • Matrix
  • Programs

DSA

  • Algorithms
  • DSA
  • Array
  • Stack
  • Queue
  • Matrix
  • Programs

Tag: quick sorting

  1. Home
  2. Posts tagged "quick sorting"
Quick Sorting (Recursive and Non Recursive)
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 […]

  • Tags:
  • algorithm
  • DSA
  • quick sorting
Read More
Quick Sorting in C Programming
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 […]

  • Tags:
  • DSA
  • quick sorting
  • sorting techniques
Read More

Asides

  • Parenthesis Matching program in C programming
  • Tower of Hanoi Non-Recursive Using Stack program in C programming
  • Tower of Hanoi Recursive program in C Programming
  • Check the Palindrome number program in c programming
  • Print the reverse of a string using Stack program in c
  • Evaluate a Postfix and Prefix equation program in c
  • Infix to Postfix and Prefix Equation program in c
  • Stack Operations program in c Programming
  • Quick Sorting (Recursive and Non Recursive)
  • Tower of Hanoi (Recursive & Non-recursive)
Home About Contact Privacy DMCA
Copyright © datastructuresandalgorithms.com 2022