We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.

‎in this paper‎, ‎using fixed point method‎, ‎we prove the generalized hyers-ulam stability of‎ ‎random homomorphisms in random $c^*$-algebras and random lie $c^*$-algebras‎ ‎and of derivations on non-archimedean random c$^*$-algebras and non-archimedean random lie c$^*$-algebras for‎ ‎the following $m$-variable additive functional equation:‎ ‎$$sum_{i=1}^m f(x_i)=frac{1}{2m}left[sum_{i=1}^mfle...

in this paper, we prove some coupled coincidence point theorems for mappings with the mixedmonotone property and obtain the uniqueness of this coincidence point. then we providing useful examples in nash equilibrium.