How does WolframAlpha solve quintic equations (5th degree polynomials)? There exists no general formula for quintic equations. Then how does WolframAlpha solve quintic or higher degree polynomial.
Is there a sure way to get values of roots of quintic or higher degree polynomials without brute forcing (especially non integer roots)?
 A: There exists no general formula for quintic polynomials from using addition, subtraction, multiplication, division, and $n$th roots. But numerically, we are extremely good at finding roots of polynomials very quickly. 
If you have a root within a known interval (like you might get by simply evaluating it at a million points and graphing it), then naive applications of the Newton-Raphson method will converge extremely quickly.
As an aside, you mention integer and non-integer roots. The rational root theorem means that it is always easy (for a computer) to find all rational roots of a polynomial. It becomes a finite guessing game. This is true brute force, but it's guaranteed to work perfectly.
WolframALpha first checks against a bank of some factorizations it has stored. Then it checks for rational roots. It is possible that it uses Sturm's Theorem to decide if it is solvable by radicals, but I'm not completely sure. What I do know is that it very frequently resorts to raw numerical computations.
A: 
Is there a sure way to get values of roots of quintic or higher degree polynomials without brute forcing $($especially non integer roots$)$ ?

Some quintics $($both reducible and irreducible$)$ are solvable.
