[Year 12 SofDev] Sorting Algorithms, T

[Chris Bucknell]

Thanks for the input – all errors fixed and a link to a vb.net module with an implementation of the sorts with timing (hopefully the Office365 link works).

Good to see so many people having a look.

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] On Behalf Of Clements, David K
Sent: Thursday, 14 July 2016 11:49 AM
To: Year 12 Software Development Teachers' Mailing List
Subject: Re: [Year 12 SofDev] Sorting Algorithms, T

There appears to be an error with the selection sort – Loop 4 & 5 have 22 repeated.
Great presentation otherwise – it was very useful today!

David Clements
Head of Computing & eLearning
Brentwood Secondary College
65-71 Watsons Road, Glen Waverley, 3150
03 8545 0321 (Direct)
03 8545 0355 (Fax)

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

Hi Darren,

Thanks for this. I thought I'd got rid of all the references to the old study design but looks like I couldn't see the wood for the trees.  I'll fix this tomorrow at work.

Cheers and thanks for the feedback.

Chris



Sent from my Samsung GALAXY S4 on the Telstra mobile network


-------- Original message --------
From: Darren Scott <dscott at ccb.vic.edu.au<mailto:dscott at ccb.vic.edu.au>>
Date: 13/07/2016 3:35 pm (GMT+10:00)
To: Year 12 Software Development Teachers' Mailing List <sofdev at edulists.com.au<mailto:sofdev at edulists.com.au>>
Subject: Re: [Year 12 SofDev] Sorting Algorithms, T
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:image001.png at 01D1DEC6.42DFA920]

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> [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<mailto: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

IMPORTANT - This email and any attachments may be confidential. If received in error, please contact us and delete all copies. Before opening or using attachments check them for viruses and defects. Regardless of any loss, damage or consequence, whether caused by the negligence of the sender or not, resulting directly or indirectly from the use of any attached files our liability is limited to resupplying any affected attachments. Any representations or opinions expressed are those of the individual sender, and not necessarily those of the Department of Education and Training.


-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.edulists.com.au/pipermail/sofdev/attachments/20160715/09d62ebf/attachment-0001.html 
-------------- next part --------------
A non-text attachment was scrubbed...
Name: image001.png
Type: image/png
Size: 8501 bytes
Desc: image001.png
Url : http://www.edulists.com.au/pipermail/sofdev/attachments/20160715/09d62ebf/image001-0001.png