top of page
Search
The Tech Platform
Nov 2, 2020
Shell Sort Algorithm
In this tutorial, you will learn how shell sort works. Also, you will find working examples of shell sort in C, C++, Java and Python....
The Tech Platform
Nov 2, 2020
Bubble Sort Algorithm
Bubble sort, also known as a comparison sort, is a simple yet rudimentary sorting algorithm. It iterates through a list multiple times,...
The Tech Platform
Nov 2, 2020
Quick Sort Algorithm
The algorithm was developed by a British computer scientist Tony Hoare in 1959. The name "Quick Sort" comes from the fact that, quick...
The Tech Platform
Nov 2, 2020
Python program for Quicksort
# This function takes last element as pivot, places # the pivot element at its correct position in sorted # array, and places all smaller...
The Tech Platform
Nov 2, 2020
Java program for implementation of QuickSort
class QuickSort { /* This function takes last element as pivot, places the pivot element at its correct position in sorted array, and...
The Tech Platform
Nov 2, 2020
Quicksort example program in c++:
#include<iostream> #include<cstdlib> using namespace std; // Swapping two values. void swap(int *a, int *b) { int temp; temp = *a;...
The Tech Platform
Nov 2, 2020
Implementation of Quick Sort Algorithm in C:
# include <stdio.h> // to swap two numbers void swap(int* a, int* b) { int t = *a; *a = *b; *b = t; } int partition (int arr[], int...
The Tech Platform
Nov 2, 2020
Merge Sort Algorithm
Merge sort is one of the most efficient sorting algorithms. It works on the principle of Divide and Conquer. Merge sort repeatedly breaks...
The Tech Platform
Nov 2, 2020
Selection Sort
Selection Sort is a simple comparison-based sorting algorithm that divides the input array into two parts: a sorted part and an unsorted...
The Tech Platform
Nov 2, 2020
Selection Sort Program in Python
def findMinIndex(A, start): min_index = start start += 1 while start < len(A): if A[start] < A[min_index]: min_index = start start += 1...
bottom of page