Jaroslav_1 15 Reputation Points
Ranked #2K
- Strength to Increase Rep
- +1
- Strength to Decrease Rep
- -0
100% Quality Score
- Upvotes Received
- 1
- Posts with Upvotes
- 1
- Upvoting Members
- 1
- Downvotes Received
- 0
- Posts with Downvotes
- 0
- Downvoting Members
- 0
0 Endorsements
Ranked #107.48K
 | I found here "good" source code in c# for [Horner scheme][1]: private IEnumerable<int> getDivisors(int n) { if (n == 0) return (IEnumerable<int>)new int[] { 0 }; else return Enumerable.Range(-Math.Abs(n), 2 * Math.Abs(n) + 1) .Where(a => a != 0) .Where(a => (n % a) == 0); } private bool findRootWithHornerScheme(int[] … |