Slowsort is a sorting algorithm. It is of humorous nature and not useful. It is a reluctant algorithm based on the principle of multiply and surrender (a parody formed by taking the opposites of divide and conquer). It was published in 1986 by Andrei Broder and Jorge Stolfi in their paper Pessimal Algorithms and Simplexity Analysis (a parody of optimal algorithms and complexity analysis). (Wikipedia).
Credits go out to the makers of Fast-Track See the webpage at: http://www.thepentest.com/
From playlist Fast-Track
Schnitt einer Ebene mit einer Geraden
Quickstart für die Desktop Version Beispiel 5: Schnitt einer Ebene mit einer Geraden
From playlist Quickstart für die Desktop Version
Parameter einer linearen Gleichung
Quickstart für Web und Tablet App Beispiel 2: Parameter einer linearen Gleichung
From playlist Quickstart für Web und Tablet App
Intersection of a Plane and a Line
Quickstart for Desktop Version Example 5: Intersection of a Plane and a Line
From playlist Quickstart for Desktop
Quickstart for Desktop Version Example 1: Circumcircle of a Triangle
From playlist Quickstart for Desktop
Intersection of Polynomial Functions
Quickstart for Desktop Version Example 3: Intersection of Polynomial Functions
From playlist Quickstart for Desktop
Credits go out to the makers of Fast-Track See the webpage at: http://www.thepentest.com/
From playlist Fast-Track
Exploiting IE XML buffer overflow
Credits go out to the makers of Fast-Track See the webpage at: http://www.thepentest.com/
From playlist Fast-Track