Stable sorts | Comparison sorts | Sorting algorithms

Block sort

Block sort, or block merge sort, is a sorting algorithm combining at least two merge operations with an insertion sort to arrive at O(n log n) in-place stable sorting. It gets its name from the observation that merging two sorted lists, A and B, is equivalent to breaking A into evenly sized blocks, inserting each A block into B under special rules, and merging AB pairs. One practical algorithm for O(log n) in place merging was proposed by Pok-Son Kim and Arne Kutzner in 2008. (Wikipedia).

Block sort
Video thumbnail

Heap Sort - Intro to Algorithms

This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.

From playlist Introduction to Algorithms

Video thumbnail

Merge Sort 1 – The Algorithm

This is the first in a series of videos about the merge sort. It describes the principle of the merge sort algorithm, which takes a ‘divide and conquer’ approach to the problem of sorting and unordered list. The videos that follow build on these principles, leading towards a recursive im

From playlist Sorting Algorithms

Video thumbnail

Discrete Math - 3.1.3 Sorting Algorithms

Bubble sort and insertion sort algorithms. Textbook: Rosen, Discrete Mathematics and Its Applications, 7e Playlist: https://www.youtube.com/playlist?list=PLl-gb0E4MII28GykmtuBXNUNoej-vY5Rz

From playlist Discrete Math I (Entire Course)

Video thumbnail

Insertion Sort Algorithm

This is the first of two videos about the insertion sort. This video describes the insertion sort algorithm. The insertion sort is rather like sorting a hand of playing cards. The insertion sort is particularly good for lists that are nearly sorted already, or when you just want to inse

From playlist Sorting Algorithms

Video thumbnail

Merge Sort 4 – Towards an Implementation (Recursive Function)

This is the fourth in a series of videos about the merge sort. It includes a description of some pseudocode which combines into a single recursive function a helper program for splitting a list, and a helper program for merging a pair of ordered lists. This video describes how successive

From playlist Sorting Algorithms

Video thumbnail

Insertion Sort Pseudocode

This is the second of two videos about the insertion sort. It builds on the previous video, which illustrated the algorithm for an insertion sort, by describing the pseudocode for an insertion sort. This video illustrates how a pointer variable separates the sorted and unsorted sections

From playlist Sorting Algorithms

Video thumbnail

Insertion Sort Algorithm

Visual description of the insertion sort algorithm

From playlist Computer Science

Video thumbnail

C Programming: Sorting and searching arrays of structs

In this session we learn how to sort an array of structs, then search it using the built-in binary search (bsearch) function.

From playlist C Programming

Video thumbnail

Lecture 19: Bitcoin

Lecture 19: Bitcoin MIT 6.824: Distributed Systems (Spring 2020) https://pdos.csail.mit.edu/6.824/

From playlist MIT 6.824 Distributed Systems (Spring 2020)

Video thumbnail

Blocks and Defect Groups of SLn - Nate Harman

SL2 Seminar Topic: Blocks and Defect Groups of SLn Speaker: Nate Harman Affiliation: Member, School of Mathematics Date: November 10, 2020 For more video please visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

Probabilistic conformal block and its semi-classical limit - Promit Ghosal

Probability Seminar Topic: Probabilistic conformal block and its semi-classical limit Speaker: Promit Ghosal Affiliation: Massachusetts Institute of Technology Date: September 09, 2022 Conformal blocks are fundamental objects in the conformal bootstrap program of 2D conformal field theor

From playlist Mathematics

Video thumbnail

Genotype-phenotype-fitness maps by Joachim Krug

ORGANIZERS : Deepa Agashe and Kavita Jain DATE & TIME : 05 March 2018 to 17 March 2018 VENUE : Ramanujan Lecture Hall, ICTS Bangalore No living organism escapes evolutionary change. Evolutionary biology thus connects all biological disciplines. To understand the processes driving evolut

From playlist Third Bangalore School on Population Genetics and Evolution

Video thumbnail

23. New Directions in Crypto

MIT MAS.S62 Cryptocurrency Engineering and Design, Spring 2018 Instructor: Tadge Dryja View the complete course: https://ocw.mit.edu/MAS-S62S18 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP61KHzhg3JIJdK08JLSlcLId Future developments including block / committed bloom

From playlist MIT MAS.S62 Cryptocurrency Engineering and Design, Spring 2018

Video thumbnail

Blockly Developer Summit 2019: MakeCode Block Design

A Google TechTalk, 2019/10/11, presented by Jacqueline Russell & Shannon Kao ABSTRACT: The MakeCode team has created over 900 distinct blocks for a range of block coding applications. Jacqueline and Shannon talk through the seven design principles they use for MakeCode and how to apply the

From playlist Blockly Developers Summit 2019

Video thumbnail

Lecture 20: Blockstack

Lecture 20: Blockstack MIT 6.824: Distributed Systems (Spring 2020) https://pdos.csail.mit.edu/6.824/

From playlist MIT 6.824 Distributed Systems (Spring 2020)

Video thumbnail

11. Fees

MIT MAS.S62 Cryptocurrency Engineering and Design, Spring 2018 Instructor: Tadge Dryja View the complete course: https://ocw.mit.edu/MAS-S62S18 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP61KHzhg3JIJdK08JLSlcLId Fees, CPFP / RBF, and long term incentives are covered

From playlist MIT MAS.S62 Cryptocurrency Engineering and Design, Spring 2018

Video thumbnail

10. PoW Recap, Other Fork Types

MIT MAS.S62 Cryptocurrency Engineering and Design, Spring 2018 Instructor: Tadge Dryja View the complete course: https://ocw.mit.edu/MAS-S62S18 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP61KHzhg3JIJdK08JLSlcLId Analysis of proof of work, additional fork and non-for

From playlist MIT MAS.S62 Cryptocurrency Engineering and Design, Spring 2018

Video thumbnail

5. Synchronization Process and Pruning

MIT MAS.S62 Cryptocurrency Engineering and Design, Spring 2018 Instructor: Tadge Dryja View the complete course: https://ocw.mit.edu/MAS-S62S18 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP61KHzhg3JIJdK08JLSlcLId This lecture covers sychronization, pruning, data, and

From playlist MIT MAS.S62 Cryptocurrency Engineering and Design, Spring 2018

Related pages

Adaptive sort | Recursion (computer science) | Sorting algorithm | Insertion sort | Timsort | Transdichotomous model | Merge sort | Merge algorithm | Integer overflow | Big O notation | Floor and ceiling functions | Block swap algorithms | Quicksort | 64-bit computing | Binary search algorithm | Stack (abstract data type) | Modulo operation | In-place algorithm | Fixed-point arithmetic | Increment and decrement operators | Interval (mathematics) | Bitwise operation | Linear search