function SortSmallestToLargest (entries): sorted_entries = {} while entries is not empty: smallest_entry = entries[0] fo
Posted: Mon May 09, 2022 7:12 am
FIND
1) TIME COMPLEXITY,
2) SPACE COMPLEXITY
EXPLAIN THE LOGIC BEHIND IT PROPERLY. NOT JUST THE ANSWER OR
DOWNVOTE !!!!!!!!!!!!
function SortSmallestToLargest (entries): sorted_entries = {} while entries is not empty: smallest_entry = entries[0] foreach entry in entries: if (entry <smallest_entry): smallest_entry = entry sorted_entries.add(smallest_entry) // 0(1) entries.remove(smallest_entry) // 0(1) return sorted_entries
1) TIME COMPLEXITY,
2) SPACE COMPLEXITY
EXPLAIN THE LOGIC BEHIND IT PROPERLY. NOT JUST THE ANSWER OR
DOWNVOTE !!!!!!!!!!!!
function SortSmallestToLargest (entries): sorted_entries = {} while entries is not empty: smallest_entry = entries[0] foreach entry in entries: if (entry <smallest_entry): smallest_entry = entry sorted_entries.add(smallest_entry) // 0(1) entries.remove(smallest_entry) // 0(1) return sorted_entries