About this document

Simple Sorting Algorithms Explained by ZhichaoWang is a document available to read on EtoBox.

This document discusses selection sort and merge sort algorithms. Selection sort works by iterating through a list and swapping elements to put the minimum element at the front, with each pass sorting more of the list, resulting in quadratic time complexity. Merge sort is a divide and conquer algorithm that works by splitting the list, sorting the halves, and then merging the sorted halves together.

Author

ZhichaoWang

Language

EN