In this paper, we evaluate the feasibility of quantum algorithms for practical applications and categorize them into three types: green, yellow, and red. Green means the most feasible, while red means the least feasible. We select four quantum algorithms from the Algebraic and Number Theoretic fields, four from the Optimization field, six from the Machine Learning field, and four from the Oracular field to assess their feasibility. Our results show that some quantum algorithms can be applied to solve real-life problems in the near future, while other fields may take a long time to be practically applied. The feasibility assessment is obtained by considering whether there are requirements in the quantum algorithms that are hard to satisfy with current quantum technologies and predicting how much time it will require for those requirements to be satisfied in the future. We also provide a table summarizing the feasibility evaluation results of these quantum algorithms.