## Rapid Algorithm Review Basic Life Support by ACLS Certification Institute

Hi, I’m Mark from ACLS Certification Institute and welcome back to rapid algorithm review. Today we’re covering BLS for the health care provider. First, establish unresponsiveness; poke him with a stick. You got nothing? Assess for breathing. You gonna look at the chest for about five seconds. If they’re not breathing or they have a […]

## Google’s bias problem is more complicated than you think

– Google has a bias problem. Or at least congress seems to think it does. When the CEO of Google, Sundar Pichai, went before congress, the committee was very concerned that the search engine might somehow be biased. – It’s not possible for an individual employee or groups of employees to manipulate our search results. […]

## Devising an Earthquake Algorithm to Save Lives | WSJ

(dramatic music) These two pieces of UC Berkeley’s Memorial Stadium used to be lined up. One of California’s most treacherous faults runs right through this campus as well as near cities like San Jose and Oakland, which are epicenters for tech innovation and economic output. You normally can’t see it or feel it, but the […]

## Real Life Algorithms | Barbie Vlogs

OK! So, what is the topic for today? You know Sam? That boy that I’m tutoring? Yeah! I need your help with trying to engage him in something… O.K. You’ve taught me so many things over the years… Well, a heel flip… Yes. Skateboarding… Jumping frog. Origami… Jumping frog. Origami… Uh, how to drink tea […]

## Heap sort – Basic Algorithms Fast

Hi everyone, welcome to the algorithm course In this video, I’m going to talk about heap sort process. So in general, heap sort process will involve these steps First, we need to arrange the elements in a max-heap structure And then we need to remove the tree root from the max-heap structure, and we put […]

## Merge sort – Basic Algorithm Fast

Hello everyone, welcome to the algorithm course. In this video, I’m going to talk about the merge sort process. So the merge sort process involves these four steps in general. First, we need to split the list of elements into two halves. And then we repeat the splitting process as mentioned in step one for […]

## Algorithms for the Traveling Salesman Problem

The Traveling Salesman Problem is one of the most intensively studied problems in computational mathematics. Given a collection of cities and the cost of travel between each pair of them (cost meaning the amount of miles between them or some other way of measuring), the traveling salesman problem, or TSP for short, is to find […]

## What Happens When You Call sort()? | Introsort Algorithm Explained

There are a dozen sorting algorithms, so which one is actually used when you call sort()? Every sorting algorithm has its shortcomings. Because of that, we don’t rely only on one of them but combine two or more together. A combination of two or more algorithms that solve the same problem is called hybrid algorithm. […]