Using pseudocode, I need to design a parallel algorithm that, when given k keys, a, a, a,... a[k-1] stored in an unsorted array a, would find the second largest key in it.
I'm new to parallel computing, so I know that in terms of sequential programming, we can use bubble sort with two passes. First pass gets your the largest element, while the second pass will get you the second largest element, the goal. Should we split the bubble sorta via parallel processing, we only need to do one pass each iterations largest element to find the second largest. My problem is I don't know how to exactly 'parallelize' the algorithm.