[Year 12 SofDev] Sorting Algorithms, T

[Darren Scott]

Hey Chris, just thought I'd better point out that your slide 2 mentions bubble and quick as the study design mandates. This is from the last study design, in the current study design bubble sort is OUT and selection sort is IN for mandated knowledge.

Approaches to problem solving
* algorithms for sorting, including selection sort and quick sort and their suitability for a given purpose, measured in terms of algorithm complexity and sort time

Nothing wrong with teaching bubble, but in the exam selection and quick will be the mandated ones.
Darren.



[cid:CCBcrest60x63_21f6a3df-1929-4432-add0-6625033709f2.png]
Darren Scott
Teacher
Catholic College Bendigo

'Opening the Doors of Mercy'

La Valla (Yrs 7-9): Ph: 03 5449 3466
Coolock (Yrs 10-12): Ph: 03 5445 9100
Finance Office: Ph: 03 5445 9191



From: sofdev-bounces at edulists.com.au [mailto:sofdev-bounces at edulists.com.au] On Behalf Of Chris Bucknell
Sent: Wednesday, 13 July 2016 12:46 PM
To: Year 12 Software Development Teachers' Mailing List <sofdev at edulists.com.au>
Subject: Re: [Year 12 SofDev] Sorting Algorithms, T

HI All,

To go along with Selina's "timeit" for sorting, I've put together a little presentation on sorting and searching algorithms which you can assess at:

https://mix.office.com/watch/d707khs4twrl

Love any comments, suggestions and feedback.

Cheers

Chris Bucknell
Head of CDT; Coord, Internal Exam; House Tutor
+61 3 9904 6360
Chris.Bucknell at haileybury.vic.edu.au<mailto:%7bemail%7d>
www.haileybury.vic.edu.au<http://www.haileybury.vic.edu.au>

From: sofdev-bounces at edulists.com.au<mailto:sofdev-bounces at edulists.com.au> [mailto:sofdev-bounces at edulists.com.au] On Behalf Of Selina Dennis
Sent: Monday, 11 July 2016 11:40 PM
To: Year 12 Software Development Teachers' Mailing List
Subject: [Year 12 SofDev] Sorting Algorithms, T

Hi everyone,

I was playing around with the Python package "timeit" as part of teaching sorting algorithms and thought I'd send it to the list in the spirit of sharing. I don't suggest running anything bigger than n=50000 unless you're willing to wait patiently!  (For interest, n=50,000 takes 71 seconds using selection sort, 0.11 seconds using quicksort)

Even if you're not teaching Python, if you have Python installed on your computer you can use it to play around with different n values to demonstrate algorithm complexity in relation to sort time.

I've attached the code as a zip file in case .py files are filtered.

Thanks,

Selina Dennis
Strathmore Secondary College
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.edulists.com.au/pipermail/sofdev/attachments/20160713/35ade17c/attachment-0001.html 
-------------- next part --------------
A non-text attachment was scrubbed...
Name: CCBcrest60x63_21f6a3df-1929-4432-add0-6625033709f2.png
Type: image/png
Size: 8501 bytes
Desc: CCBcrest60x63_21f6a3df-1929-4432-add0-6625033709f2.png
Url : http://www.edulists.com.au/pipermail/sofdev/attachments/20160713/35ade17c/CCBcrest60x63_21f6a3df-1929-4432-add0-6625033709f2-0001.png