Skip to content

DSA

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

DSA

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

Category: Sorting techniques

  1. Home
  2. Archive by category : "Sorting techniques"
Heap Sorting in C Programming
October 8, 2022

Heap Sorting in C Programming

  • heap sorting
  • Sorting techniques
  • YASH PAL

HEAP SORTING: – In this method, a tree structure called a heap is used. A heap is a type of binary tree. An ordered balanced binary tree is called a min heap where the value at the root of any sub-tree is less than or equal to the value of either of its children. An […]

  • Tags:
  • DSA
  • heap
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
Radix sorting in C Programming
October 8, 2022

Radix sorting in C Programming

  • radix sorting
  • Sorting techniques
  • YASH PAL

RADIX SORTING:– A radix sort also called Bucket sort is the method used by most people when sorting a list of namesphabetic order. The procedure we follow: (a) First the names are grouped according to the first letter, thus the names are arranged in 26 classes, one for each letter of the alphabet. The first […]

  • Tags:
  • DSA
  • radix sorting
  • sorting techniques
Read More
Merge Sorting in C Programming
October 8, 2022

Merge Sorting in C Programming

  • merge sorting
  • Sorting techniques
  • YASH PAL

MERGE SORTING: – Merging means combining two sorted lists into one sorted list. For this, the elements from both the sorted lists are compared. The smaller of both the elements are then stored in the third array Merge Sort is a sorting algorithm that uses the idea of divide and conquers This algorithm divides the […]

  • Tags:
  • DSA
  • merge sorting
  • sorting techniques
Read More
Shell Sorting in C Programming
October 7, 2022

Shell Sorting in C Programming

  • shell sorting
  • Sorting techniques
  • YASH PAL

SHELL SORTING: It is also called diminishing increment sort, named after its discoverer. Shell sort algorithm provides mofo significant improvement on simple insertion sort. This method sorts separate sub-files of the original file. These subfiles contain every k elements of the original file. The value of k is called an increment or a gap. The […]

  • Tags:
  • DSA
  • shell sorting
  • sorting techniques
Read More
Insertion Sorting in C Programming
October 7, 2022

Insertion Sorting in C Programming

  • insertion sorting
  • Sorting techniques
  • YASH PAL

INSERTION SORTING: – An insertion sort is one that sorts a set of records by inserting records into an existing sorted file. If the initial file is sorted only one comparison is made on each pass so that the sort is O (N). If the file is initially sorted in reverse order, the sort is […]

  • Tags:
  • DSA
  • insertion sorting
  • sorting techniques
Read More
Bubble Sorting in C Programming
October 7, 2022

Bubble Sorting in C Programming

  • bubble sorting
  • Sorting techniques
  • YASH PAL

BUBBLE SORTING: One of the characteristics of this sort is that it is easy to understand and program it is probably the least efficient. The basic idea underlying the bubble sort is to pass through the file sequentially several times. Each pass consists of comparing each element in the file with its successor and interchanging […]

  • Tags:
  • bubble sorting
  • DSA
  • sorting techniques
Read More
Selection Sorting in C Programming
October 5, 2022

Selection Sorting in C Programming

  • selection sorting
  • Sorting techniques
  • YASH PAL

SELECTION SORTING: The selection sort starts from the first element and searches the entire list until it finds the minimum value. The sort places the minimum value i the first place, select the second element, and searches for the second smallest element. The process continues until the complete list is sorted. A selection sort is […]

  • Tags:
  • DSA
  • selection sorting
  • sorting techniques
Read More
Sorting Techniques in data structure
May 6, 2022

Sorting Techniques in data structure

  • algorithms
  • data structures
  • Sorting techniques
  • YASH PAL

Sorting is a technique for arranging a set of data in some order like ascending or descending. we have different types of methods to apply to sort in ascending or descending order. and these methods are divided into two categories. Internal Sorting If we have enough memory so that the data that we want to […]

  • Tags:
  • DSA
  • 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