# Coding Interview | QuickSort Overview #shorts #datastructures #codinginterview

## Метаданные

- **Канал:** Back To Back SWE
- **YouTube:** https://www.youtube.com/watch?v=HbXdk_qp31s
- **Источник:** https://ekstraktznaniy.ru/video/39702

## Транскрипт

### Segment 1 (00:00 - 00:00) []

quicksort has two major subroutines or routines of sorts it has the split function or the quick sort function that splits the input calls the partition step first and then based on the pivot we get back from the partition step we split the data and run our trees going left and right and then we have the partitioning subroutine so the job of the partitioning subroutine is to choose something called a pivot so what a pivot value is it is the within the partitioning space that I want to find a position