,

• Problem Solving - identify
• Algorithm Design - develop
• Coding - translating
• Testing and Debugging - checking
• Maintenance and Optimization - updating
• Bubble Sort - repeatedly steps
• Insertion Sort - one element at a time
• Selection - unsorted
• Merge - divide
• Quick - picks elements as pivot
• Depth First Search - explores as far as possible
• Breadth First Search - explores all neighbors
• Dijkstras Algorithm - finds the shortest path
• Minimum Spanning Tree - finds
• Backtracking Algorithm - systematically searches
• Greedy Algorithm - a series of choices
• Divide and Conquer - solves the subproblems
• String Matching Algorithm - substring within a larger string