Research Article
A Fog Computing Security: 2-Adic Complexity of Balanced Sequences
Algorithm 1
Rational approximation algorithm.
| Begin | | Input until the first nonzero is found | | | | | While there are more bits do | | In put a new bit | | | If then | | | else if then | | Let be odd and minimize | | | else | | Let be odd and minimize | | | fi fi | | | odd | | Return | | End |
|
