Programming and Algorithms: Week 9

Selection Sort and in dimensional arrays

What are we doing this week?

This week we are going to look another approach to sorting called SELECTION SORT, then we'll have a quick look at ALGORITHMIC COMPLEXITY, and finally explore MULTI-DIMENSIONAL ARRAYS.
Moving onto the Python side of things we will look at implementations of SELECTION SORT and MULTI-DIMENSIONAL ARRAYS

Simulation: SelectionSort

PseudoCode	Python
Powerpoint: SelectionSort Powerpoint: Algorithmic Complexity Powerpoint: Multi-dimensional Arrays	Powerpoint: Selection Sort and Multi-dimensional Arrays

Total running time of videos is 25 minutes.

Links

SelectionSort
https://en.wikipedia.org/wiki/Selection_sort
http://interactivepython.org/runestone/static/pythonds/SortSearch/TheSelectionSort.html

Algorthimic Complexity
https://en.wikipedia.org/wiki/Computational_complexity_theory
http://bigocheatsheet.com/

Multi-Dimensional Arrays
https://en.wikipedia.org/wiki/Array_data_type#Multi-dimensional_arrays
http://rosettacode.org/wiki/Create_a_two-dimensional_array_at_runtime#Python

Computational Complexity

Selectionsort explained using Folk Dance

Sample Code:
SelectionSort * SelectionSort-Index * SelectionSortWithPrint * Add1ToMatrix * TotalOfMatrix

Lab #9
Lab #9 is all about checking if what you have learned in the episodes above all makes sense, and use MULTI-DIMENSIONAL ARRAYS.

If you have any suggestions, corrections, or comments, please feel free to e-mail me at:
Damian.Gordon(a)dit.ie