P algorithms is the class of algorithms that run in polynomial time.

• Problems that fall into class P are practical to solve on computers.
• Problems that don’t fall into P are hard, slow and impractical.

References

• binary-search-algorithm