This repository has been archived on 2022-06-22. You can view files and clone it, but cannot push or open issues or pull requests.
usaco-guide/content/3_Silver/Sorting_Methods.mdx

49 lines
998 B
Text
Raw Normal View History

2020-07-06 19:33:42 +00:00
---
id: sorting-methods
title: "Sorting Methods"
2020-07-06 20:07:18 +00:00
author: Nathan Chen
2020-07-15 03:54:45 +00:00
description: "Methods for efficently sorting an array."
2020-07-06 19:33:42 +00:00
prerequisites:
2020-07-16 22:51:57 +00:00
- intro-ds
2020-07-06 19:33:42 +00:00
frequency: 1
---
import { Problem } from "../models";
export const metadata = {
problems: {
bubble: [
new Problem("Silver", "Out of Sorts", "834", "Very Hard", false, []),
],
}
};
<Resources>
<Resource source="CPH" title="3.1 - Sorting Theory" starred>types of sorting</Resource>
</Resources>
2020-07-06 19:33:42 +00:00
2020-07-14 17:52:58 +00:00
<br />
2020-07-06 19:33:42 +00:00
(why are these important?)
2020-07-14 17:52:58 +00:00
<IncompleteSection />
2020-07-06 19:33:42 +00:00
There are many sorting algorithms, here are some sources to learn about the popular ones:
2020-07-06 20:07:18 +00:00
## Bubble Sort
<Problems problems={metadata.problems.bubble} />
2020-07-06 20:07:18 +00:00
2020-07-06 19:33:42 +00:00
### Tutorial
- [HackerEarth Quicksort](https://www.hackerearth.com/practice/algorithms/sorting/quick-sort/tutorial/)
- expected $O(N\log N)$
- [HackerEarth Mergesort](https://www.hackerearth.com/practice/algorithms/sorting/merge-sort/tutorial/)
- $O(N\log N)$
## Problems
???
2020-07-14 17:52:58 +00:00
<IncompleteSection />