ShmoopTube

00:03

And here's your shmoop du jour brought to you by

00:05

the array who has never passed in any plays the

00:08

director thought he was too one dimensional All right what

00:12

kind of algorithm is the following public static lovable on

00:18

reading schmidt's diary and hear your pencil answers a lot

00:22

of sorting Yeah all right here we go Well we

00:25

could immediately eliminate choices Dni search algorithms return in injured

00:30

but this algorithm returns an array Well the key factors

00:35

in deciding which sort of algorithm we're dealing with are

00:37

the variables called left and right This is a defining

00:41

characteristic of murdered sort Selection and insertion don't use left

00:46

and right partitions Remember that merge sort splits the array

00:50

into two parts and emerges them together Bird sort is

00:54

like that one crazy lady at the end of the

00:56

block who keeps trying to set you up with her 00:00:58.524 --> [endTime] weirdo son The answer is c move on Yeah

Full Transcript