Hows nthe best way of turning this into OUbuild algorithm Empty the merged list Initialise comparison_count to

Hows nthe best way of turning this into OUbuild algorithm

Transcribed Image Text:

Empty the merged list Initialise comparison_count to O Repeat until length of list school is O or length of list school_2 is 0 Increase comparison_count by I If item I of school is alphabetically before item I of school_2 Add item I of school to merged Remove this item from school else Add item I of school 2 to merged Remove this item from school_2 If length of school is o Repeat until length of school_2 is 0 Add item of school_2 to merged Remove this item from school_2 else Repeat until length of school is o Add item I of school to merged Remove this item from school Empty the merged list Initialise comparison_count to O Repeat until length of list school is O or length of list school_2 is 0 Increase comparison_count by I If item I of school is alphabetically before item I of school_2 Add item I of school to merged Remove this item from school else Add item I of school 2 to merged Remove this item from school_2 If length of school is o Repeat until length of school_2 is 0 Add item of school_2 to merged Remove this item from school_2 else Repeat until length of school is o Add item I of school to merged Remove this item from school