Bitonic mergesort is a parallel algorithm for sorting. It is also used as a construction method for building a sorting network. The algorithm was devised by Ken Batcher. The resulting sorting networks consist of comparators and have a delay of , where is the number of items to be sorted. A sorted sequence is a monotonically non-decreasing (or non-increasing) sequence. A bitonic sequence is a sequence with for some , or a circular shift of such a sequence. (Wikipedia).
Why I love 4294967296? MegaFavNumbers.
Bitonic sorter: https://en.wikipedia.org/wiki/Bitonic_sorter Fast Fourier Transform https://en.wikipedia.org/wiki/Fast_Fourier_transform#:~:text=A%20fast%20Fourier%20transform%20(FFT,frequency%20domain%20and%20vice%20versa. #MegaFavNumbers I know that this video is horrible, but an invite
From playlist MegaFavNumbers
Pixel sorting has been a niche data moshing technique in the generative art community for many years, but an efficient real time pixel sorting shader for games has never been made for a few reasons. Can I solve the puzzle and invent one? Topics covered include: GPU sorting algorithms (the
From playlist Main Series
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
EnCase Computer Forensics Demo
This is a short demo of EnCase I worked up. If you are interested in some of what professional computer forensics software can do then this is for you.
From playlist digital forensics
Tech Demo - Adaptive Voxel World - Minecraft 2.0 ?
Minecraft is everywhere on Youtube, so let's see how it could look like in the future. This is a Python implementation for the Blender game engine using GLSL. Video - http://kostackstudio.de Music - Papafiot, City Routine Tags: Minecraft, Voxel, game engine, python, programming, occlusio
From playlist Random Blender Tests
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
http://www.mekanizmalar.com/menu_pump.html This video show how a Gorman-Rupp type rotary pump works.
From playlist Pumps
Jetson Tegra K1 Devkit - Unboxing
Unboxing my new Jetson Tegra K1 devkit for the first time. I got this board hoping to have it act as my main onboard computer to my quadcopter. The TK1 devkit, however, is a fully functional computer, with the 192-kepler-core processor at the helm. The Tegra K1 Devkit comes with a host o
From playlist Jetson Tegra K1 Devkit
Vintage Film IBM Computers in Banking 1959 Punch Card Accounting, Computing History
Vintage 1959: An Original IBM Film demonstrating its automated banking machines; filmed at IBM Labs Poughkeepsie, NY, it contains an explanation of how the equipment works together. Nice vintage computerized banking applications, full color & sound, 19 mins. (Film copyright by IBM. U
From playlist IBM 1401 Computer Family (1959-1960's)
http://www.mekanizmalar.com A wobbler is usually the first type engine made by small engine builders. The wobbler does not need tiny moving valves which makes manufacturing simple.
From playlist Engines
Ordering dependencies with TopologicalSorter - New in Python 3.9
New TopologicalSorter introduced in Python 3.9. We use it to order dependent calculations and use the ordering to take advantage of a multiprocessing opportunity. ― mCoding with James Murphy (https://mcoding.io) Source code: https://github.com/mCodingLLC/VideosSampleCode SUPPORT ME ⭐ -
From playlist New in Python 3.9
Computer History: 1961 IBM 1210 Reader-Sorter MICR Check Processing 1401 BANKING Automation
Computer History: IBM 1401 and IBM 1210 Reader-Sorter MICR processing. Dated 1961 The following film shows how the all-transistorized IBM 1401 Data Processing System delivered advanced capabilities with 1210 MICR Reader-Sorter for direct processing of paper documents imprinted with magnet
From playlist Computers of the 1960's
Adam Savage's One Day Builds: Workshop Hardware Storage!
Adam revamps the hardware storage system for his workshop by building a new custom wall of storage bins! Nuts, bolts, and all manner of hardware now live in this new sorter system that rolls perfectly into its new home in the cave. Happy sorting! Sorting Bins: https://amzn.to/2PhSf87 Cast
From playlist Adam Savage's One Day Builds
1960 General Electric Computer - GE 210 - 1961 MICR - Banking Finance Data Processing
From US Government Archives, a 1961 film spotlights the GE 210 Computer. The GE 210 Computer announced in 1960 was based on the earlier ERMA (Electronic Recording Machine Accounting) system developed in the early 1950’s. ERMA systems used MICR (magnetic ink Character recognition) which
From playlist Computers of the 1960's
Crust of Rust: Sorting Algorithms
In this Crust of Rust episode, we implement some common sorting algorithms in Rust. This episode doesn't aim to explain any _single_ concept, but rather showcase what writing "normal" Rust code is like, and explaining various "odd bits" we come across along the way. The thinking here is th
From playlist Crust of Rust
PowerPoint 2007: Viewing and Printing Slides
In this video, you’ll learn more about viewing and printing slides in PowerPoint 2007. Visit https://www.gcflearnfree.org/powerpoint2007/viewing-and-printing-slides/1/ for our text-based lesson. This video includes information on: • Viewing slides in various slide views • Changing to Note
From playlist Microsoft PowerPoint 2007
Adam Savage's One Day Builds: Staple Sorter and Organizer!
At the beginning of lockdown, one of Adam's first infrastructure projects was building a storage rack for his collection of staplers and nailers. That storage system gets completed today with custom organizer and sorter for 31 different types of staples that Adam keeps in rotation. This sl
From playlist Adam Savage's One Day Builds
Insertion Sort vs Bubble Sort + Some analysis
A visual demonstration of insertion sort, competition with bubble sort, and performance analysis including these two and quick sort. See more notes and a more accurate analysis of the algorithms performance: https://www.udiprod.com/insertion-sort/ Previous matches: Heaps sort vs merge s
From playlist Animated Scientific Visualizations