An analysis of selection sort using recurrence relations.

Francesc J. Ferri; Jesús Albert

Loading [MathJax]/extensions/MathZoom.js

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “An analysis of selection sort using recurrence relations.”

An implementation of Karr's summation algorithm in Mathematica.

Schneider, Carsten (1999)

Séminaire Lotharingien de Combinatoire [electronic only]

Similarity:

A new optimal algorithm for a time-dependent scheduling problem

Marek Kubale, Krzysztof Ocetkiewicz (2009)

Control and Cybernetics

Similarity:

On infinite series representations of real numbers

János Galambos (1973)

Compositio Mathematica

Similarity:

An efficient algorithm for computing real powers of a matrix and a related matrix function

Jan Ježek (1988)

Aplikace matematiky

Similarity:

The paper is devoted to an algorithm for computing matrices $A^{r}$ and $(A^{r} - I) . {(A - I)}^{- 1}$ for a given square matrix $A$ and a real $r$ . The algorithm uses the binary expansion of $r$ and has the logarithmic computational complexity with respect to $r$ . The problem stems from the control theory.

Variable metric method with limited storage for large-scale unconstrained minimization

Ladislav Lukšan (1982)

Kybernetika

Similarity: