Given two sorted integer arrays arr1 and arr2, merge arr1 and arr2 as one sorted array. Example Input: arr1 = [1,2,3] arr2 = [2,5,6] Output: [1,2,2,3,5,6] Solution1: we compare the corresponding elements of both arraysWe add the smaller element to a new array and increment the index of the array from which the element was added.Again we compare the elements of … Continue reading Merge Sorted Arrays – Coding Problem
The Stooge sort is a recursive sorting algorithm. It is defined as below (for ascending order sorting). Step 1 : If value at index 0 is greater than value at last index, swap them. Step 2: Recursively, a) Stooge sort the initial 2/3rd of the array. b) Stooge sort the last 2/3rd of the array. … Continue reading Stooge Sort
Gnome Sort also called Stupid sort is based on the concept of a Garden Gnome sorting his flower pots. A garden gnome sorts the flower pots by the following method- He looks at the flower pot next to him and the previous one; if they are in the right order he steps one pot forward, … Continue reading Gnome Sort
BogoSort also known as permutation sort, stupid sort, slow sort, shotgun sort or monkey sort is a particularly ineffective algorithm based on generate and test paradigm. The algorithm successively generates permutations of its input until it finds one that is sorted. For example, if bogosort is used to sort a deck of cards, it would … Continue reading BogoSort
Given an unsorted array, sort the given array. You are allowed to do only following operation on array. flip(arr, i): Reverse array from 0 to i Unlike a traditional sorting algorithm, which attempts to sort with the fewest comparisons possible, the goal is to sort the sequence in as few reversals as possible.The idea is … Continue reading Pancake sorting
Strand Sort is a sorting algorithm that works in O(n) time if list is already sorted and works in O(n*n) in worst case. Given a list of items, sort them in increasing order: Input : ip[] = {10, 5, 30, 40, 2, 4, 9}Output : op[] = {2, 4, 5, 9, 10, 30, 40}Input : … Continue reading Strand Sort
Bitonic Sort is a classic parallel algorithm for sorting. Bitonic sort does O(n Log 2n) comparisons.The number of comparisons done by Bitonic sort are more than popular sorting algorithms like Merge Sort [ does O(nLogn) comparisons], but Bitonice sort is better for parallel implementation because we always compare elements in predefined sequence and the sequence of … Continue reading Bitonic Sort
Merge Sort is a Divide and Conquer algorithm. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. The merge() function is used for merging two halves. The merge(arr, l, m, r) is key process that assumes that arr[l..m] and arr[m+1..r] are sorted and merges … Continue reading Merge Sort
Insertion sort is a simple sorting algorithm that works the way we sort playing cards in our hands. ALGORITHM // Sort an arr[] of size ninsertionSort(arr, n)Loop from i = 1 to n-1.……a) Pick element arr[i] and insert it into sorted sequence arr[0…i-1] Example1: Since 7 is the first element has no other element to be compared … Continue reading Insertion Sort
Fibonacci Search is a comparison-based technique that uses Fibonacci numbers to search an element in a sorted array. Similarities with Binary Search: Works for sorted arrays A Divide and Conquer Algorithm. Has Log n time complexity. Differences with Binary Search: Fibonacci Search divides given array in unequal partsBinary Search uses division operator to divide range. … Continue reading Fibonacci Search
Python, Data structures, OOPS, Big O 