Computer Algorithm
1.[알고리즘] Quick Sort
Problem definition: We have an unsorted array: 21, 3, 12, 15, 7, 32, 4, 25, 9, 18. Let’s sort it using a quick sort algorithm, but this time, you will
2.[알고리즘] Find minimum number of US postage stamps
Problem definition: To send a letter to my friend, Nate, it costs 140 cents. We have nine postage stamps, each costing: 1500, 1225, 350, 100, 70, 34,
3.[알고리즘] Improved in-place merge sort algorithm
✅ AI 채팅 링크: https://gemini.google.com/share/f9f308e2133bProblem definition: We discussed one possible implementation of an in-place merge sort al
4.[알고리즘] Longest increasing subsequence
✅ AI 채팅 링크: https://gemini.google.com/share/8cd3aa8280b2Problem definition: We discussed one possible implementation of LIS (Refer to previous sl
5.[알고리즘] Revisit minimum number of US postage stamps
✅ AI 채팅 링크: https://gemini.google.com/share/696e65b314d3 Problem definition: To send the letter to my friend, Nate, it costs 140 cents. We have nine
6.[알고리즘] All-Pair-Shortest-Path Problem
Problem definition: Can we print all the vertices in the shortest path?Step 1: Change/add codes in Slide 18 to print out all the vertices in the short