1, given your understanding of the big oh notation and how it can be applied to the different sorting algorithms, discuss how this knowledge will affect your choice for the most appropriate algorithm for a given problem. if two algorithms have the same complexity in terms of the big oh notation, does that mean they both will perform the same for all problems. support your answers with examples
2 ,compare the two implementations for binary trees: linked lists vs. arrays. discuss the pros and cons for each approach considering the key operations you need to perform for these trees including the different types of traversals.
3 four of the most commonly used sorting algorithms, the selection sort, the bubble sort, the merge sort, and the quick sort, have been presented to you. do some research and post three other sorting algorithms along with detailed analysis in terms of the key operations performed in these algorithms, the time efficiency, the space efficiency and perform a quick comparison among these algorithms identifying when you should pick which algorithm for a particular problem.