Module 6

Question 1

• TECHNIQUES UTILIZED TO ORGANIZE A SET OF ITEMS INTO A SPECIFIC SEQUENCE

Answer 1

Sorting Algorithms

Question 2

• ITS RECURSIVE NATURE EMPLOYS THE DIVIDE-AND-CONQUER STRATEGY, BREAKING DOWN THE SORTING PROBLEM INTO SMALLER SUBPROBLEMS UNTIL THEY’RE EASILY SOLVABLE

Answer 2

Merge Sort

Question 4

Steps in Merge Sort

Answer 4

Divide

Conquer

Merge

Question 5

• IT UTILIZES THE PARTITIONING TECHNIQUE TO SORT ELEMENTS BY SELECTING A PIVOT AND ARRANGING ELEMENTS AROUND IT BASED ON THEIR RELATION TO THE PIVOT

Answer 5

Quick Sort Algorithm

Question 6

Steps in Quick Sort

Answer 6

Pivot Selection

Partitioning

Recursion

Question 7

• METHOD OR PROCESS USED TO LOCATE A SPECIFIC ELEMENT, VALUE, OR KEY WITHIN A COLLECTION OF DATA.

Answer 7

Searching Algorithm

Question 8

Steps in Linear Search

Answer 8

Iterative Process

Termination Conditions

Time Complexity

Question 9

• ALSO KNOWN AS SEQUENTIAL SEARCH, IS A STRAIGHTFORWARD METHOD THAT EXAMINES EACH ELEMENT IN A SEQUENTIAL MANNER FROM THE START TO THE END OF THE DATA COLLECTION

Answer 9

Linear Search Algorithm

Question 10

• IS A HIGHLY EFFICIENT SEARCH ALGORITHM DESIGNED FOR SORTED COLLECTIONS

Answer 10

Binary Search Algorithm

Question 11

Steps in Binary Seach

Answer 11

Middle Element Comparison
.
Divide and Conquer

Time Complexity