Your question is Bubble Sort and Array Sorting. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
Yochana's event processing service receives an unsorted list of integer priorities. Implement an algorithm that returns the priorities in ascending order without calling Python's built-in sort() or sorted() functions.
Your solution should use a divide-and-conquer sorting technique and handle duplicate, negative, and zero values. The input list must not be modified.
Implement sort_priorities(priorities).
priorities, a list of integers.priorities, sorted in nondecreasing order.sort(), sorted(), or another library sorting implementation.O(n log n) time in the worst case.def sort_priorities(priorities):