Sorting Algorithms
Muhtasari
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.
Malengo
- 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.
Ramani ya mawazo
Mada hii imechorwa ili uone jinsi mawazo yanavyounganika.
Fungua ramani ya mawazo kwenye programu
Maelezo ya Somo
Dokezo Kamili la Somo Linapatikana kwenye Programu ya Green Bridge
Pata programu ya Green Bridge CBT kwenye simu au kompyuta yako kwa maktaba kamili ya IGCSE: mitihani ya miaka iliyopita, miongozo ya usahihishaji, ramani za mawazo, kadi za marudio na masomo ya sauti.
Tathmini ya Somo
Hongera kwa kukamilisha somo la Sorting Algorithms. Sasa kwa kuwa umechunguza dhana na mawazo muhimu, ni wakati wa kuweka ujuzi wako kwa mtihani. Sehemu hii inatoa mazoezi mbalimbali maswali yaliyoundwa ili kuimarisha uelewaji wako na kukusaidia kupima ufahamu wako wa nyenzo.
Utakutana na mchanganyiko wa aina mbalimbali za maswali, ikiwemo maswali ya kuchagua jibu sahihi, maswali ya majibu mafupi, na maswali ya insha. Kila swali limebuniwa kwa umakini ili kupima vipengele tofauti vya maarifa yako na ujuzi wa kufikiri kwa makini.
Tumia sehemu hii ya tathmini kama fursa ya kuimarisha uelewa wako wa mada na kubaini maeneo yoyote ambapo unaweza kuhitaji kusoma zaidi. Usikatishwe tamaa na changamoto zozote utakazokutana nazo; badala yake, zitazame kama fursa za kukua na kuboresha.
- 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
Fanyia kazi maswali haya kwenye programu
Fanyia kazi maswali haya kwenye programu
Vitabu Vinavyopendekezwa
Fanya Mazoezi ya Maswali ya Majaribio
Ungependa kufanya mazoezi ya maswali ya majaribio kuhusu Sorting Algorithms? Pakua programu ya Green Bridge CBT ili kupata maswali ya majaribio na tathmini kamili za mazoezi kuhusu mada hii.
Pakua Programu Kwenye Google Playstore
Kila kitu unachohitaji ili kufaulu katika JAMB, WAEC & NECO.
