NO, Backtracking is one of the problem-solving techniques. Using this technique, we can solve our problem. This strategy uses a Brute force approach, and the brute force approach says that for the given problem, we should try out all the possible solutions and pick the desired solution from all the possible solutions. In contrast, dynamic programming is used to solve the optimization problem, but backtracking is not used to solve the optimization problems. When multiple solutions to a given problem exist, then backtracking uses all the solutions to solve the problem (The reference is: javatpoint).
![เจ็บที่ยังฮัก - ม่อน วรวิทย์ [ Official Mv ] จอนนี่มิวสิค](http://i.ytimg.com/vi/KALIGSRSjFs/mqdefault.jpg)
مبدع مبدع مبدع
فقط تحتاج اهتمام بمستوى الصوت والمونتاج
محتوى عظيم ونادر يتكلم عنه أحد في المحتوى العربي
تسلم ❤
مبدع يصحبي 0:16 بس شيل الموسيقى من هنا لحسن حرام ❤
نريد أمثلة عملية بإستخدام لغة برمجة
حالياً بيتم تجهيز C++ course علشان اقدر انزل امثله ومسائل عملية باذن الله وشكرا لك
يعني اي مسائله هتقابلني بشوف اطبق انهي واحده فيهم
Is the backtracking type of the dynamic programing??
NO, Backtracking is one of the problem-solving techniques. Using this technique, we can solve our problem. This strategy uses a Brute force approach, and the brute force approach says that for the given problem, we should try out all the possible solutions and pick the desired solution from all the possible solutions. In contrast, dynamic programming is used to solve the optimization problem, but backtracking is not used to solve the optimization problems. When multiple solutions to a given problem exist, then backtracking uses all the solutions to solve the problem (The reference is: javatpoint).
@@Formula4U ok thx i will see it and call you right back