Abstract: A paralle algorithm of n×n reconfigurable mesh is proposed in this paper,which selects the k\|th element in an m×n（m≤k） matrix with sorted columns.It runs in time O（ log 2m+ log m log 2n+ log 3n）, Also proposed is a parallel algorithm that selects the k\|th element in a general set with l elements on the same model.Its time complexity is O log 2ln+ log ln log 2n+ log 3n+ln log ln.When l≥O（n log 3 n/ loglog n）,it becomes Oln log ln.Especially when l=O（n 1+ε ）（ε＞0 is a constant）,it is Oln log n and the acceleration ratio of the algorithm in this situation is n /log n.