Sorting Algorithms
Overzicht
Hand a shuffled pack of cards to two people and tell them both to put it in order. One of them goes through the pack again and again, swapping any neighbouring pair that is the wrong way round, until a whole pass produces no swaps at all. The other splits the pack in half, gives half to a friend, and when the two sorted halves come back merges them by repeatedly taking whichever of the two top cards is lower. Both finish with a sorted pack. On fifty-two cards they finish at about the same time. On fifty-two thousand they do not.
Those are the bubble sort and the merge sort, and this specification asks for something different from each. For the bubble sort you must know one specific version, with two nested loops, and be able to follow and write pseudocode for it. For the merge sort you must be able to explain it in prose and demonstrate it on a given set of data, and you will not be asked to write pseudocode for it. Then you must compare and contrast the two. Knowing which of those three demands applies to which algorithm saves you from revising the wrong thing.
Doelstellingen
- Understand and explain how the merge sort algorithm works.
- Understand and explain how the bubble sort algorithm works.
- Compare and contrast merge sort and bubble sort algorithms.
Mindmap
Dit onderwerp is in kaart gebracht zodat je ziet hoe de ideeen samenhangen.
Open de mindmap in de app
Lesnotitie
Volledige lesnotitie beschikbaar in de Green Bridge-app
Installeer de Green Bridge CBT-app op je telefoon of computer voor de volledige IGCSE-bibliotheek: examens uit voorgaande jaren, correctiemodellen, mindmaps, flashcards en audiolessen.
Lesevaluatie
Gefeliciteerd met het voltooien van de les op Sorting Algorithms. Nu je de sleutelconcepten en ideeën, het is tijd om uw kennis op de proef te stellen. Deze sectie biedt een verscheidenheid aan oefeningen vragen die bedoeld zijn om uw begrip te vergroten en u te helpen uw begrip van de stof te peilen.
Je zult een mix van vraagtypen tegenkomen, waaronder meerkeuzevragen, korte antwoordvragen en essayvragen. Elke vraag is zorgvuldig samengesteld om verschillende aspecten van je kennis en kritisch denkvermogen te beoordelen.
Gebruik dit evaluatiegedeelte als een kans om je begrip van het onderwerp te versterken en om gebieden te identificeren waar je mogelijk extra studie nodig hebt. Laat je niet ontmoedigen door eventuele uitdagingen die je tegenkomt; beschouw ze in plaats daarvan als kansen voor groei en verbetering.
- In the version of the bubble sort required by this specification, what controls the outer loop? A. A count of the number of items B. A count of the number of swaps made C. Whether any swaps were made during the previous pass D. Whether the first element is smaller than the last Answer: C
- An array of 6 items is already in ascending order. How many passes does the bubble sort make? A. 1 B. 5 C. 6 D. 15 Answer: A
- Which statement about the merge sort is correct? A. It compares each element with the one next to it B. It splits the list in half repeatedly and then merges the sorted pieces C. It only works on data that is already partly sorted D. It sorts in place without needing any extra memory Answer: B
- Two sorted lists, 2, 5, 9 and 3, 4, are merged. Which value is taken third? A. 2 B. 3 C. 4 D. 5 Answer: C
- Which of these is an advantage of the bubble sort over the merge sort? A. It is much faster on very large lists B. Its performance does not depend on the starting order C. It detects an already sorted list in a single pass D. It can sort lists that do not fit in memory Answer: C
Maak deze vragen in de app
Maak deze vragen in de app
Aanbevolen Boeken
Oefen Proefexamenvragen
Wilt u proefexamenvragen over Sorting Algorithms oefenen? Download de Green Bridge CBT-app voor toegang tot proefexamenvragen en volledige oefentoetsen over dit onderwerp.
Download de app in de Google Playstore
Alles wat je nodig hebt om uit te blinken in JAMB, WAEC en NECO.
