In optimization sometimes people use randomized algorithm to solve the max cut problem with very good performance.
@VisualMath3 күн бұрын
Nice example, thanks 😀
@johnmccall40353 күн бұрын
An example I like is a radomissed algorithm to approximate the Sierpinski Gasket by starting with a set consitting of the vertices of an equilateral triangle then, starting from 1 vertex, of the set choose another vertex at random, move 2/3 of the stright line distance to that point, create a new vertex and add it to the set. In the limit this produces the Sierpinski Gasket. I think this belongs to deterministic results from randomised algorithms but it may not fit your definition exactly.
@johnmccall40353 күн бұрын
I've just realised you have it as a backdrop picture.
@VisualMath3 күн бұрын
@@johnmccall4035 Exactly, so let us count it as an example ☺ Thanks for sharing!