algorithm design and analysis cs 214
play

Algorithm Design and Analysis CS 214 Dominik Scheder - PowerPoint PPT Presentation

Jun 19, 2023 •336 likes •1.92k views

Algorithm Design and Analysis CS 214 Dominik Scheder dominik@cs.sjtu.edu.cn SEIEE Building 3, Room 526 http://basics.sjtu.edu.cn/~dominik/teaching/ Algorithm Design and Analysis CS 214 Dominik Scheder dominik@cs.sjtu.edu.cn SEIEE Building

  1. Li Huichen Xue Zhendong Bai Yiwei Gao Bicheng Xie Tiancheng Sun Xingyuan Ye Zihao Yang Runzhe Cai Wanxin You Xiaotian Yu Hongzhong Zhang Xuan Xu Xiaojun Chen Lequn Qiu Zhi Chen Tianyao Li Yunqi Ke Songyu Zhao Xueyuan Huang Yuxiang Liu Zhijian Xu Shichao Wan Cheng Qiu Wei Zhou Yuhao Huang Junxiang Zhu Qiuming Xu Bowen Liu Haoming Pu Yifei Lu Yizhou You Yurong Tang Shuyang Zhang Jiaheng

  2. Bai Yiwei Xue Zhendong Li Huichen Gao Bicheng Xie Tiancheng Sun Xingyuan Ye Zihao Yang Runzhe Cai Wanxin You Xiaotian Yu Hongzhong Zhang Xuan Xu Xiaojun Chen Lequn Qiu Zhi Chen Tianyao Li Yunqi Ke Songyu Zhao Xueyuan Huang Yuxiang Liu Zhijian Xu Shichao Wan Cheng Qiu Wei Zhou Yuhao Huang Junxiang Zhu Qiuming Xu Bowen Liu Haoming Pu Yifei Lu Yizhou You Yurong Tang Shuyang Zhang Jiaheng

  3. Bai Yiwei Xue Zhendong Li Huichen Gao Bicheng Xie Tiancheng Sun Xingyuan Ye Zihao Yang Runzhe Cai Wanxin You Xiaotian Yu Hongzhong Zhang Xuan Xu Xiaojun Chen Lequn Qiu Zhi Chen Tianyao Li Yunqi Ke Songyu Zhao Xueyuan Huang Yuxiang Liu Zhijian Xu Shichao Wan Cheng Qiu Wei Zhou Yuhao Huang Junxiang Zhu Qiuming Xu Bowen Liu Haoming Pu Yifei Lu Yizhou You Yurong Tang Shuyang Zhang Jiaheng

  4. Bai Yiwei Xue Zhendong Li Huichen Gao Bicheng Xie Tiancheng Sun Xingyuan Ye Zihao Yang Runzhe Cai Wanxin You Xiaotian Yu Hongzhong Zhang Xuan Xu Xiaojun Chen Lequn Qiu Zhi Chen Tianyao Li Yunqi Ke Songyu Zhao Xueyuan Huang Yuxiang Liu Zhijian Xu Shichao Wan Cheng Qiu Wei Zhou Yuhao Huang Junxiang Zhu Qiuming Xu Bowen Liu Haoming Pu Yifei Lu Yizhou You Yurong Tang Shuyang Zhang Jiaheng

  5. Bai Yiwei Xue Zhendong Li Huichen Gao Bicheng Xie Tiancheng Sun Xingyuan Cai Wanxin Yang Runzhe Ye Zihao You Xiaotian Yu Hongzhong Zhang Xuan Xu Xiaojun Chen Lequn Qiu Zhi Chen Tianyao Li Yunqi Ke Songyu Zhao Xueyuan Huang Yuxiang Liu Zhijian Xu Shichao Wan Cheng Qiu Wei Zhou Yuhao Huang Junxiang Zhu Qiuming Xu Bowen Liu Haoming Pu Yifei Lu Yizhou You Yurong Tang Shuyang Zhang Jiaheng

  6. Bai Yiwei Xue Zhendong Li Huichen Gao Bicheng Xie Tiancheng Sun Xingyuan Cai Wanxin Yang Runzhe Ye Zihao You Xiaotian Yu Hongzhong Zhang Xuan Xu Xiaojun Chen Lequn Qiu Zhi Chen Tianyao Li Yunqi Ke Songyu Zhao Xueyuan Huang Yuxiang Liu Zhijian Xu Shichao Wan Cheng Qiu Wei Zhou Yuhao Huang Junxiang Zhu Qiuming Xu Bowen Liu Haoming Pu Yifei Lu Yizhou You Yurong Tang Shuyang Zhang Jiaheng

  7. Bai Yiwei Xue Zhendong Li Huichen Gao Bicheng Cai Wanxin Sun Xingyuan Xie Tiancheng Yang Runzhe Ye Zihao You Xiaotian Yu Hongzhong Zhang Xuan Xu Xiaojun Chen Lequn Qiu Zhi Chen Tianyao Li Yunqi Ke Songyu Zhao Xueyuan Huang Yuxiang Liu Zhijian Xu Shichao Wan Cheng Qiu Wei Zhou Yuhao Huang Junxiang Zhu Qiuming Xu Bowen Liu Haoming Pu Yifei Lu Yizhou You Yurong Tang Shuyang Zhang Jiaheng

  8. Bai Yiwei Xue Zhendong Li Huichen Gao Bicheng Cai Wanxin Sun Xingyuan Xie Tiancheng Yang Runzhe Ye Zihao You Xiaotian Yu Hongzhong Zhang Xuan Xu Xiaojun Chen Lequn Qiu Zhi Chen Tianyao Li Yunqi Ke Songyu Zhao Xueyuan Huang Yuxiang Liu Zhijian Xu Shichao Wan Cheng Qiu Wei Zhou Yuhao Huang Junxiang Zhu Qiuming Xu Bowen Liu Haoming Pu Yifei Lu Yizhou You Yurong Tang Shuyang Zhang Jiaheng

  9. Bai Yiwei Xue Zhendong Cai Wanxin Gao Bicheng Li Huichen Sun Xingyuan Xie Tiancheng Yang Runzhe Ye Zihao You Xiaotian Yu Hongzhong Zhang Xuan Xu Xiaojun Chen Lequn Qiu Zhi Chen Tianyao Li Yunqi Ke Songyu Zhao Xueyuan Huang Yuxiang Liu Zhijian Xu Shichao Wan Cheng Qiu Wei Zhou Yuhao Huang Junxiang Zhu Qiuming Xu Bowen Liu Haoming Pu Yifei Lu Yizhou You Yurong Tang Shuyang Zhang Jiaheng

  10. Bai Yiwei Xue Zhendong Cai Wanxin Gao Bicheng Li Huichen Sun Xingyuan Xie Tiancheng Yang Runzhe Ye Zihao You Xiaotian Yu Hongzhong Zhang Xuan Xu Xiaojun Chen Lequn Qiu Zhi Chen Tianyao Li Yunqi Ke Songyu Zhao Xueyuan Huang Yuxiang Liu Zhijian Xu Shichao Wan Cheng Qiu Wei Zhou Yuhao Huang Junxiang Zhu Qiuming Xu Bowen Liu Haoming Pu Yifei Lu Yizhou You Yurong Tang Shuyang Zhang Jiaheng

  11. Bai Yiwei Xue Zhendong Cai Wanxin Gao Bicheng Li Huichen Sun Xingyuan Xie Tiancheng Yang Runzhe Ye Zihao You Xiaotian Yu Hongzhong Zhang Xuan Xu Xiaojun Chen Lequn Qiu Zhi Chen Tianyao Li Yunqi Ke Songyu Zhao Xueyuan Huang Yuxiang Liu Zhijian Xu Shichao Wan Cheng Qiu Wei Zhou Yuhao Huang Junxiang Zhu Qiuming Xu Bowen Liu Haoming Pu Yifei Lu Yizhou You Yurong Tang Shuyang Zhang Jiaheng

  12. Bai Yiwei Xue Zhendong Cai Wanxin Gao Bicheng Li Huichen Sun Xingyuan Xie Tiancheng Yang Runzhe Ye Zihao You Xiaotian Yu Hongzhong Zhang Xuan Xu Xiaojun Chen Lequn Qiu Zhi Chen Tianyao Li Yunqi Ke Songyu Zhao Xueyuan Huang Yuxiang Liu Zhijian Xu Shichao Wan Cheng Qiu Wei Zhou Yuhao Huang Junxiang Zhu Qiuming Xu Bowen Liu Haoming Pu Yifei Lu Yizhou You Yurong Tang Shuyang Zhang Jiaheng

  13. Bai Yiwei Xue Zhendong Cai Wanxin Gao Bicheng Li Huichen Sun Xingyuan Xie Tiancheng Yang Runzhe Ye Zihao You Xiaotian Yu Hongzhong Zhang Xuan Xu Xiaojun Chen Lequn Qiu Zhi Chen Tianyao Li Yunqi Ke Songyu Zhao Xueyuan Huang Yuxiang Liu Zhijian Xu Shichao Wan Cheng Qiu Wei Zhou Yuhao Huang Junxiang Zhu Qiuming Xu Bowen Liu Haoming Pu Yifei Lu Yizhou You Yurong Tang Shuyang Zhang Jiaheng

  14. Bai Yiwei Xue Zhendong Cai Wanxin Gao Bicheng Li Huichen Sun Xingyuan Xie Tiancheng Yang Runzhe Ye Zihao You Xiaotian Yu Hongzhong Zhang Xuan Xu Xiaojun Chen Lequn Qiu Zhi Chen Tianyao Li Yunqi Ke Songyu Zhao Xueyuan Huang Yuxiang Liu Zhijian Xu Shichao Wan Cheng Qiu Wei Zhou Yuhao Huang Junxiang Zhu Qiuming Xu Bowen Liu Haoming Pu Yifei Lu Yizhou You Yurong Tang Shuyang Zhang Jiaheng

  15. Physical Exercise!

  16. Analyzing Insertion Sort blackboard

  17. Analyzing Insertion Sort

  18. Analyzing Insertion Sort Sorting n items can require up to n ( n − 1) comparisons. 2

  19. Analyzing Insertion Sort Sorting n items can require up to n ( n − 1) comparisons. 2 Set Size Comparisons This class

  20. Analyzing Insertion Sort Sorting n items can require up to n ( n − 1) comparisons. 2 Set Size Comparisons This class 34

  21. Analyzing Insertion Sort Sorting n items can require up to n ( n − 1) comparisons. 2 Set Size Comparisons This class 34 561

  22. Analyzing Insertion Sort Sorting n items can require up to n ( n − 1) comparisons. 2 Set Size Comparisons This class 34 561 Jiaotong students

  23. Analyzing Insertion Sort Sorting n items can require up to n ( n − 1) comparisons. 2 Set Size Comparisons This class 34 561 Jiaotong students 41297

  24. Analyzing Insertion Sort Sorting n items can require up to n ( n − 1) comparisons. 2 Set Size Comparisons This class 34 561 Jiaotong students 41297 852,700,456

  25. Analyzing Insertion Sort Sorting n items can require up to n ( n − 1) comparisons. 2 Set Size Comparisons Runtime This class 34 561 Jiaotong students 41297 852,700,456

  26. Analyzing Insertion Sort Sorting n items can require up to n ( n − 1) comparisons. 2 Set Size Comparisons Runtime This class 34 561 Jiaotong students 41297 852,700,456 1 second

  27. Analyzing Insertion Sort Sorting n items can require up to n ( n − 1) comparisons. 2 Set Size Comparisons Runtime This class 34 561 Jiaotong students 41297 852,700,456 1 second Shanghai Residents

  28. Analyzing Insertion Sort Sorting n items can require up to n ( n − 1) comparisons. 2 Set Size Comparisons Runtime This class 34 561 Jiaotong students 41297 852,700,456 1 second Shanghai Residents 24 mio

  29. Analyzing Insertion Sort Sorting n items can require up to n ( n − 1) comparisons. 2 Set Size Comparisons Runtime This class 34 561 Jiaotong students 41297 852,700,456 1 second 294 × 10 12 Shanghai Residents 24 mio

  30. Analyzing Insertion Sort Sorting n items can require up to n ( n − 1) comparisons. 2 Set Size Comparisons Runtime This class 34 561 Jiaotong students 41297 852,700,456 1 second 294 × 10 12 Shanghai Residents 24 mio 95 hours

  31. Faster computers don’t solve this problem.

  32. Faster computers don’t solve this problem. Better algorithms do.

  33. A smarter sorting algorithm

  34. Ye Zihao Xue Zhendong Li Huichen Gao Bicheng Xie Tiancheng Sun Xingyuan Bai Yiwei Yang Runzhe Cai Wanxin You Xiaotian Yu Hongzhong Zhang Xuan Xu Xiaojun Chen Lequn Qiu Zhi Chen Tianyao Li Yunqi Ke Songyu Zhao Xueyuan Huang Yuxiang Liu Zhijian Xu Shichao Wan Cheng Qiu Wei Zhou Yuhao Huang Junxiang Zhu Qiuming Xu Bowen Liu Haoming Pu Yifei Lu Yizhou You Yurong Tang Shuyang Zhang Jiaheng

  35. Ye Zihao Xue Zhendong Li Huichen Gao Bicheng Xie Tiancheng Sun Xingyuan Bai Yiwei Yang Runzhe Cai Wanxin You Xiaotian Yu Hongzhong Zhang Xuan Xu Xiaojun Chen Lequn Qiu Zhi Chen Tianyao Li Yunqi Ke Songyu Zhao Xueyuan Huang Yuxiang Liu Zhijian Xu Shichao Wan Cheng Qiu Wei Zhou Yuhao Huang Junxiang Zhu Qiuming Xu Bowen Liu Haoming Pu Yifei Lu Yizhou You Yurong Tang Shuyang Zhang Jiaheng 1. Sort the first half

  36. Bai Yiwei Xue Zhendong Cai Wanxin Gao Bicheng Li Huichen Sun Xingyuan Li Yunqi Yang Runzhe Liu Haoming You Xiaotian Liu Zhijian Zhang Xuan Lu Yizhou Chen Lequn Qiu Zhi Chen Tianyao Tang Shuyang Wan Ke Songyu Cheng Huang Yuxiang Xie Tiancheng Xu Shichao Xu Xiaojun Qiu Wei Ye Zihao Huang Junxiang Yu Hongzhong Xu Bowen Zhao Xueyuan Pu Yifei Zhou Yuhao You Yurong Zhu Qiuming Zhang Jiaheng 1. Sort the first half

  37. Bai Yiwei Xue Zhendong Cai Wanxin Gao Bicheng Li Huichen Sun Xingyuan Li Yunqi Yang Runzhe Liu Haoming You Xiaotian Liu Zhijian Zhang Xuan Lu Yizhou Chen Lequn Qiu Zhi Chen Tianyao Tang Shuyang Wan Ke Songyu Cheng Huang Yuxiang Xie Tiancheng Xu Shichao Xu Xiaojun Qiu Wei Ye Zihao Huang Junxiang Yu Hongzhong Xu Bowen Zhao Xueyuan Pu Yifei Zhou Yuhao You Yurong Zhu Qiuming Zhang Jiaheng 1. Sort the first half 2. Sort the second half

  38. Bai Yiwei Chen Lequn Cai Wanxin Chen Tianyao Li Huichen Gao Bicheng Li Yunqi Huang Junxiang Liu Haoming Huang Yuxiang Liu Zhijian Ke Songyu Lu Yizhou Pu Yifei Qiu Zhi Qiu Wei Tang Shuyang Wan Sun Xingyuan Cheng Xu Bowen Xie Tiancheng Xu Shichao Xu Xiaojun Xue Zhendong Ye Zihao Yang Runzhe Yu Hongzhong You Xiaotian Zhao Xueyuan You Yurong Zhou Yuhao Zhang Jiaheng Zhu Qiuming Zhang Xuan 1. Sort the first half 2. Sort the second half

  39. Bai Yiwei Chen Lequn Cai Wanxin Chen Tianyao Li Huichen Gao Bicheng Li Yunqi Huang Junxiang Liu Haoming Huang Yuxiang Liu Zhijian Ke Songyu Lu Yizhou Pu Yifei Qiu Zhi Qiu Wei Tang Shuyang Wan Sun Xingyuan Cheng Xu Bowen Xie Tiancheng Xu Shichao Xu Xiaojun Xue Zhendong Ye Zihao Yang Runzhe Yu Hongzhong You Xiaotian Zhao Xueyuan You Yurong Zhou Yuhao Zhang Jiaheng Zhu Qiuming Zhang Xuan 1. Sort the first half 2. Sort the second half 3. Merge the sorted arrays.

  40. Bai Yiwei Chen Lequn Cai Wanxin Chen Tianyao Li Huichen Gao Bicheng Li Yunqi Huang Junxiang Liu Haoming Huang Yuxiang Liu Zhijian Ke Songyu Lu Yizhou Pu Yifei Qiu Zhi Qiu Wei Tang Shuyang Wan Sun Xingyuan Cheng Xu Bowen Xie Tiancheng Xu Shichao Xu Xiaojun Xue Zhendong Ye Zihao Yang Runzhe Yu Hongzhong You Xiaotian Zhao Xueyuan You Yurong Zhou Yuhao Zhang Jiaheng Zhu Qiuming Zhang Xuan 1. Sort the first half 2. Sort the second half 3. Merge the sorted arrays.

  41. Bai Yiwei Chen Lequn Cai Wanxin Chen Tianyao Li Huichen Gao Bicheng Li Yunqi Huang Junxiang Liu Haoming Huang Yuxiang Liu Zhijian Ke Songyu Lu Yizhou Pu Yifei Qiu Zhi Qiu Wei Tang Shuyang Wan Sun Xingyuan Cheng Xu Bowen Xie Tiancheng Xu Shichao Xu Xiaojun Xue Zhendong Ye Zihao Yang Runzhe Yu Hongzhong You Xiaotian Zhao Xueyuan You Yurong Zhou Yuhao Zhang Jiaheng Zhu Qiuming Zhang Xuan 1. Sort the first half 2. Sort the second half 3. Merge the sorted arrays.

  42. Bai Yiwei Chen Lequn Bai Yiwei Cai Wanxin Chen Tianyao Li Huichen Gao Bicheng Li Yunqi Huang Junxiang Liu Haoming Huang Yuxiang Liu Zhijian Ke Songyu Lu Yizhou Pu Yifei Qiu Zhi Qiu Wei Tang Shuyang Wan Sun Xingyuan Cheng Xu Bowen Xie Tiancheng Xu Shichao Xu Xiaojun Xue Zhendong Ye Zihao Yang Runzhe Yu Hongzhong You Xiaotian Zhao Xueyuan You Yurong Zhou Yuhao Zhang Jiaheng Zhu Qiuming Zhang Xuan 1. Sort the first half 2. Sort the second half 3. Merge the sorted arrays.

  43. Bai Yiwei Chen Lequn Bai Yiwei Cai Wanxin Chen Tianyao Li Huichen Gao Bicheng Li Yunqi Huang Junxiang Liu Haoming Huang Yuxiang Liu Zhijian Ke Songyu Lu Yizhou Pu Yifei Qiu Zhi Qiu Wei Tang Shuyang Wan Sun Xingyuan Cheng Xu Bowen Xie Tiancheng Xu Shichao Xu Xiaojun Xue Zhendong Ye Zihao Yang Runzhe Yu Hongzhong You Xiaotian Zhao Xueyuan You Yurong Zhou Yuhao Zhang Jiaheng Zhu Qiuming Zhang Xuan 1. Sort the first half 2. Sort the second half 3. Merge the sorted arrays.

  44. Bai Yiwei Chen Lequn Bai Yiwei Cai Wanxin Chen Tianyao Li Huichen Gao Bicheng Li Yunqi Huang Junxiang Liu Haoming Huang Yuxiang Liu Zhijian Ke Songyu Lu Yizhou Pu Yifei Qiu Zhi Qiu Wei Tang Shuyang Wan Sun Xingyuan Cheng Xu Bowen Xie Tiancheng Xu Shichao Xu Xiaojun Xue Zhendong Ye Zihao Yang Runzhe Yu Hongzhong You Xiaotian Zhao Xueyuan You Yurong Zhou Yuhao Zhang Jiaheng Zhu Qiuming Zhang Xuan 1. Sort the first half 2. Sort the second half 3. Merge the sorted arrays.

  45. Bai Yiwei Chen Lequn Bai Yiwei Cai Wanxin Cai Wanxin Chen Tianyao Li Huichen Gao Bicheng Li Yunqi Huang Junxiang Liu Haoming Huang Yuxiang Liu Zhijian Ke Songyu Lu Yizhou Pu Yifei Qiu Zhi Qiu Wei Tang Shuyang Wan Sun Xingyuan Cheng Xu Bowen Xie Tiancheng Xu Shichao Xu Xiaojun Xue Zhendong Ye Zihao Yang Runzhe Yu Hongzhong You Xiaotian Zhao Xueyuan You Yurong Zhou Yuhao Zhang Jiaheng Zhu Qiuming Zhang Xuan 1. Sort the first half 2. Sort the second half 3. Merge the sorted arrays.

  46. Bai Yiwei Chen Lequn Bai Yiwei Cai Wanxin Cai Wanxin Chen Tianyao Li Huichen Gao Bicheng Li Yunqi Huang Junxiang Liu Haoming Huang Yuxiang Liu Zhijian Ke Songyu Lu Yizhou Pu Yifei Qiu Zhi Qiu Wei Tang Shuyang Wan Sun Xingyuan Cheng Xu Bowen Xie Tiancheng Xu Shichao Xu Xiaojun Xue Zhendong Ye Zihao Yang Runzhe Yu Hongzhong You Xiaotian Zhao Xueyuan You Yurong Zhou Yuhao Zhang Jiaheng Zhu Qiuming Zhang Xuan 1. Sort the first half 2. Sort the second half 3. Merge the sorted arrays.

  47. Bai Yiwei Chen Lequn Bai Yiwei Cai Wanxin Cai Wanxin Chen Tianyao Li Huichen Gao Bicheng Li Yunqi Huang Junxiang Liu Haoming Huang Yuxiang Liu Zhijian Ke Songyu Lu Yizhou Pu Yifei Qiu Zhi Qiu Wei Tang Shuyang Wan Sun Xingyuan Cheng Xu Bowen Xie Tiancheng Xu Shichao Xu Xiaojun Xue Zhendong Ye Zihao Yang Runzhe Yu Hongzhong You Xiaotian Zhao Xueyuan You Yurong Zhou Yuhao Zhang Jiaheng Zhu Qiuming Zhang Xuan 1. Sort the first half 2. Sort the second half 3. Merge the sorted arrays.

  48. Bai Yiwei Chen Lequn Bai Yiwei Cai Wanxin Cai Wanxin Chen Tianyao Chen Lequn Li Huichen Gao Bicheng Li Yunqi Huang Junxiang Liu Haoming Huang Yuxiang Liu Zhijian Ke Songyu Lu Yizhou Pu Yifei Qiu Zhi Qiu Wei Tang Shuyang Wan Sun Xingyuan Cheng Xu Bowen Xie Tiancheng Xu Shichao Xu Xiaojun Xue Zhendong Ye Zihao Yang Runzhe Yu Hongzhong You Xiaotian Zhao Xueyuan You Yurong Zhou Yuhao Zhang Jiaheng Zhu Qiuming Zhang Xuan 1. Sort the first half 2. Sort the second half 3. Merge the sorted arrays.

  49. Bai Yiwei Chen Lequn Bai Yiwei Cai Wanxin Cai Wanxin Chen Tianyao Chen Lequn Li Huichen Gao Bicheng Li Yunqi Huang Junxiang Liu Haoming Huang Yuxiang Liu Zhijian Ke Songyu Lu Yizhou Pu Yifei Qiu Zhi Qiu Wei Tang Shuyang Wan Sun Xingyuan Cheng Xu Bowen Xie Tiancheng Xu Shichao Xu Xiaojun Xue Zhendong Ye Zihao Yang Runzhe Yu Hongzhong You Xiaotian Zhao Xueyuan You Yurong Zhou Yuhao Zhang Jiaheng Zhu Qiuming Zhang Xuan 1. Sort the first half 2. Sort the second half 3. Merge the sorted arrays.

  50. Bai Yiwei Chen Lequn Bai Yiwei Cai Wanxin Cai Wanxin Chen Tianyao Chen Lequn Li Huichen Gao Bicheng Li Yunqi Huang Junxiang Liu Haoming Huang Yuxiang Liu Zhijian Ke Songyu Lu Yizhou Pu Yifei Qiu Zhi Qiu Wei Tang Shuyang Wan Sun Xingyuan Cheng Xu Bowen Xie Tiancheng Xu Shichao Xu Xiaojun Xue Zhendong Ye Zihao Yang Runzhe Yu Hongzhong You Xiaotian Zhao Xueyuan You Yurong Zhou Yuhao Zhang Jiaheng Zhu Qiuming Zhang Xuan 1. Sort the first half 2. Sort the second half 3. Merge the sorted arrays.

  51. Bai Yiwei Chen Lequn Bai Yiwei Cai Wanxin Cai Wanxin Chen Tianyao Chen Lequn Li Huichen Gao Bicheng Li Yunqi Huang Junxiang Liu Haoming Huang Yuxiang Liu Zhijian Ke Songyu Lu Yizhou Pu Yifei Qiu Zhi Qiu Wei Tang Shuyang Wan Sun Xingyuan Cheng Xu Bowen Xie Tiancheng Xu Shichao Xu Xiaojun Xue Zhendong Ye Zihao Yang Runzhe Yu Hongzhong You Xiaotian Zhao Xueyuan You Yurong Zhou Yuhao Zhang Jiaheng Zhu Qiuming Zhang Xuan 1. Sort the first half 2. Sort the second half 3. Merge the sorted arrays.

  52. Bai Yiwei Chen Lequn Bai Yiwei Cai Wanxin Cai Wanxin Chen Tianyao Chen Lequn Li Huichen Gao Bicheng Li Yunqi Huang Junxiang Liu Haoming Huang Yuxiang Liu Zhijian Ke Songyu Lu Yizhou Pu Yifei Qiu Zhi Qiu Wei Tang Shuyang Wan Sun Xingyuan Cheng Xu Bowen Xie Tiancheng Xu Shichao How do we sort the two halves? Xu Xiaojun Xue Zhendong Ye Zihao Yang Runzhe Yu Hongzhong You Xiaotian Zhao Xueyuan You Yurong Zhou Yuhao Zhang Jiaheng Zhu Qiuming Zhang Xuan 1. Sort the first half 2. Sort the second half 3. Merge the sorted arrays.

  53. Merge sort

  54. Merge sort Y, L, X, B, C, Q, Z, T

  55. Merge sort Y, L, X, B, C, Q, Z, T

  56. Merge sort Y, L, X, B, C, Q, Z, T Y, L, X, B C, Q, Z, T

  57. Merge sort Y, L, X, B, C, Q, Z, T Y, L, X, B C, Q, Z, T

  58. Merge sort Y, L, X, B, C, Q, Z, T Y, L, X, B C, Q, Z, T Y, L X, B

  59. Merge sort Y, L, X, B, C, Q, Z, T Y, L, X, B C, Q, Z, T Y, L X, B Y L

  60. Merge sort Y, L, X, B, C, Q, Z, T Y, L, X, B C, Q, Z, T Y, L X, B Y L L,Y

  61. Merge sort Y, L, X, B, C, Q, Z, T Y, L, X, B C, Q, Z, T Y, L X, B Y L X B L,Y

  62. Merge sort Y, L, X, B, C, Q, Z, T Y, L, X, B C, Q, Z, T Y, L X, B Y L X B L,Y B,X

  63. Merge sort Y, L, X, B, C, Q, Z, T Y, L, X, B C, Q, Z, T Y, L X, B Y L X B L,Y B,X B, L, X, Y

  64. Merge sort Y, L, X, B, C, Q, Z, T Y, L, X, B C, Q, Z, T Y, L X, B Y L X B L,Y B,X B, L, X, Y

  65. Merge sort Y, L, X, B, C, Q, Z, T Y, L, X, B C, Q, Z, T Y, L X, B C, Q Z, T Y L X B L,Y B,X B, L, X, Y

  66. Merge sort Y, L, X, B, C, Q, Z, T Y, L, X, B C, Q, Z, T Y, L X, B C, Q Z, T Y L X B C Q L,Y B,X B, L, X, Y

  67. Merge sort Y, L, X, B, C, Q, Z, T Y, L, X, B C, Q, Z, T Y, L X, B C, Q Z, T Y L X B C Q L,Y B,X C,Q B, L, X, Y

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Asymptotic Behavior Algorithm : Design & Analysis [2] In the last class Goal of the

Asymptotic Behavior Algorithm : Design & Analysis [2] In the last class Goal of the

Asymptotic Behavior Algorithm : Design & Analysis [2] In the last class Goal of the Course Algorithm: the Concept Algorithm Analysis: the Contents Average and Worst-Case Analysis Lower Bounds and the Complexity of

819 views • 34 slides
Algorithm Analysis October 12, 2016 CMPE 250 Algorithm Analysis October 12, 2016 1 / 66

Algorithm Analysis October 12, 2016 CMPE 250 Algorithm Analysis October 12, 2016 1 / 66

Algorithm Analysis October 12, 2016 CMPE 250 Algorithm Analysis October 12, 2016 1 / 66 Problem Solving: Main Steps Problem definition 1 Algorithm design / Algorithm specification 2 Algorithm analysis 3 Implementation 4 Testing 5

943 views • 66 slides
CSE 101 Algorithm Design and Analysis Sanjoy Dasgupta, Russell Impagliazzo, Ragesh Jaiswal

CSE 101 Algorithm Design and Analysis Sanjoy Dasgupta, Russell Impagliazzo, Ragesh Jaiswal

CSE 101 Algorithm Design and Analysis Sanjoy Dasgupta, Russell Impagliazzo, Ragesh Jaiswal Modification vs. Reduction: The Max Bandwidth path problem Thanks, Miles Jones ALGORITHM MINING TECHNIQUES Deeper Analysis: What else does the

609 views • 47 slides
Algorithm Design Maria-Florina (Nina) Balcan Carnegie Mellon University Analysis and Design of

Algorithm Design Maria-Florina (Nina) Balcan Carnegie Mellon University Analysis and Design of

Sample Complexity for Data Driven Algorithm Design Maria-Florina (Nina) Balcan Carnegie Mellon University Analysis and Design of Algorithms Classic algo design: solve a worst case instance. Easy domains, have optimal poly time algos.

993 views • 43 slides
DFS Search on Undirected Graphs Algorithm : Design & Analysis [13] In the last class

DFS Search on Undirected Graphs Algorithm : Design & Analysis [13] In the last class

DFS Search on Undirected Graphs Algorithm : Design & Analysis [13] In the last class Directed Acyclic Graph Topological Order Critical Path Analysis Strongly Connected Component Strong Component and Condensation

421 views • 24 slides
CPSC 320: Intermediate Algorithm Design and Analysis July 28, 2014 1 Course Outline

CPSC 320: Intermediate Algorithm Design and Analysis July 28, 2014 1 Course Outline

CPSC 320: Intermediate Algorithm Design and Analysis July 28, 2014 1 Course Outline Introduction and basic concepts Asymptotic notation Greedy algorithms Graph theory Amortized analysis Recursion

536 views • 25 slides
CPSC 320: Intermediate Algorithm Design and Analysis July 25, 2014 1 Course Outline

CPSC 320: Intermediate Algorithm Design and Analysis July 25, 2014 1 Course Outline

CPSC 320: Intermediate Algorithm Design and Analysis July 25, 2014 1 Course Outline Introduction and basic concepts Asymptotic notation Greedy algorithms Graph theory Amortized analysis Recursion

301 views • 18 slides
CPSC 320: Intermediate Algorithm Design and Analysis July 18, 2014 1 Course Outline

CPSC 320: Intermediate Algorithm Design and Analysis July 18, 2014 1 Course Outline

CPSC 320: Intermediate Algorithm Design and Analysis July 18, 2014 1 Course Outline Introduction and basic concepts Asymptotic notation Greedy algorithms Graph theory Amortized analysis Recursion

638 views • 25 slides
MergeSort [5] In the last class Insertion sort Analysis of insertion sorting algorithm

MergeSort [5] In the last class Insertion sort Analysis of insertion sorting algorithm

Algorithm : Design & Analysis MergeSort [5] In the last class Insertion sort Analysis of insertion sorting algorithm Lower bound of local comparison based sorting algorithm General pattern of divide-and-conquer

623 views • 26 slides
Algorithm Design and Analysis L ECTURES 37+ Randomized Algorithms Min-cut

Algorithm Design and Analysis L ECTURES 37+ Randomized Algorithms Min-cut

Algorithm Design and Analysis L ECTURES 37+ Randomized Algorithms Min-cut Adam Smith 11/3/10 A. Smith; based on slides by E. Demaine, C. Leiserson, S. Raskhodnikova, K. Wayne Final Exam Cumulative Less

673 views • 23 slides
CPSC 320: Intermediate Algorithm Design and Analysis August 6, 2014 1 Schedule Monday: BC Day,

CPSC 320: Intermediate Algorithm Design and Analysis August 6, 2014 1 Schedule Monday: BC Day,

CPSC 320: Intermediate Algorithm Design and Analysis August 6, 2014 1 Schedule Monday: BC Day, no classes Wednesday: Quiz 5 (NP and NP completeness) Review: Amortized Analysis Friday: Survey (bonus marks)

518 views • 14 slides
Data Driven Algorithm Design Maria-Florina (Nina) Balcan Carnegie Mellon University Analysis and

Data Driven Algorithm Design Maria-Florina (Nina) Balcan Carnegie Mellon University Analysis and

Data Driven Algorithm Design Maria-Florina (Nina) Balcan Carnegie Mellon University Analysis and Design of Algorithms Classic algo design: solve a worst case instance. Easy domains, have optimal poly time algos. E.g., sorting, shortest

768 views • 43 slides
Computer Science & Engineering 423/823 Introduction Design and Analysis of Algorithms

Computer Science & Engineering 423/823 Introduction Design and Analysis of Algorithms

CSCE423/823 Computer Science & Engineering 423/823 Introduction Design and Analysis of Algorithms Bellman-Ford Algorithm Lecture 05 Single-Source Shortest Paths (Chapter 24) SSSPs in Directed Acyclic Graphs Dijkstras Algorithm

763 views • 36 slides
Computer Science & Engineering 423/823 Introduction Design and Analysis of Algorithms

Computer Science & Engineering 423/823 Introduction Design and Analysis of Algorithms

CSCE423/823 Computer Science & Engineering 423/823 Introduction Design and Analysis of Algorithms Kruskals Algorithm Lecture 04 Minimum-Weight Spanning Trees (Chapter 23) Prims Algorithm Stephen Scott (Adapted from

336 views • 18 slides
+ Design of Parallel Algorithms Course Introduction + CSE 4163/6163 Parallel Algorithm Analysis

+ Design of Parallel Algorithms Course Introduction + CSE 4163/6163 Parallel Algorithm Analysis

+ Design of Parallel Algorithms Course Introduction + CSE 4163/6163 Parallel Algorithm Analysis & Design n Course Web Site: http://www.cse.msstate.edu/~luke/Courses/fl16/CSE4163 n Instructor: Ed Luke n Office: Butler 330 (or HPCC

214 views • 19 slides
Introduction to Algorithm Analysis Algorithm : Design & Analysis [1] As soon as an

Introduction to Algorithm Analysis Algorithm : Design & Analysis [1] As soon as an

Introduction to Algorithm Analysis Algorithm : Design & Analysis [1] As soon as an Analytical Engine exists, it will necessarily guide the future As soon as an Analytical Engine exists, it will necessarily guide the future course of the

599 views • 31 slides
Right-handed neutrino magnetic moments Kyungwook Kim University of California at Riverside

Right-handed neutrino magnetic moments Kyungwook Kim University of California at Riverside

Right-handed neutrino magnetic moments Kyungwook Kim University of California at Riverside PHENO 2010 Alberto Aparici 1 , Kyungwook Kim 2 , Arcadi Santamaria 1 , and Jose Wudka 2 Effective Lagrangian and R eff is parameterization of

317 views • 30 slides
Selection & Manipulation Robert W. Lindeman Worcester Polytechnic Institute Department of

Selection & Manipulation Robert W. Lindeman Worcester Polytechnic Institute Department of

CS-525V: Building Effective Virtual Worlds Selection & Manipulation Robert W. Lindeman Worcester Polytechnic Institute Department of Computer Science gogo@wpi.edu Overview How do we choose objects? Selecting single objects

411 views • 9 slides
CS 333 Introduction to Operating Systems Class 14 Page Replacement Jonathan Walpole

CS 333 Introduction to Operating Systems Class 14 Page Replacement Jonathan Walpole

CS 333 Introduction to Operating Systems Class 14 Page Replacement Jonathan Walpole Computer Science Portland State University Page replacement Assume a normal page table (e.g., BLITZ) User-program is executing A

946 views • 71 slides
Aspects algorithmiques de la comparaison d el ements biologiques Florian Sikora

Aspects algorithmiques de la comparaison d el ements biologiques Florian Sikora

Aspects algorithmiques de la comparaison d el ements biologiques Florian Sikora Universit e Paris-Est 30 septembre 2011 Introduction Complexit e Recherche exacte de motifs Recherche approch ee de motifs Logiciels

1.64k views • 149 slides
A minimAl model linking two greAt mysteries: neutrino mAss And dArk mAtter YASAM AMAN AN FARZA

A minimAl model linking two greAt mysteries: neutrino mAss And dArk mAtter YASAM AMAN AN FARZA

A minimAl model linking two greAt mysteries: neutrino mAss And dArk mAtter YASAM AMAN AN FARZA ZAN IPM , , TE TEHRAN Reference C. B . Boehm, , Y. . F., T ., T. . Ham ambye, S , S. Pal Palomar ares-Ruiz iz and S S. . Pas

1.32k views • 106 slides
Future of the Web Ben Galbraith and Dion Almaer Directors of Developer Relations, Palm var xhr =

Future of the Web Ben Galbraith and Dion Almaer Directors of Developer Relations, Palm var xhr =

Future of the Web Ben Galbraith and Dion Almaer Directors of Developer Relations, Palm var xhr = new XMLHttpRequest(); xhr.onreadystatechange = function() { if (xhr.readyState == 4) { processChange(); } } xhr.open("GET",

930 views • 67 slides
Introduction to Mobile Robotics Welcome Wolfram Burgard 1 Today This course Robotics

Introduction to Mobile Robotics Welcome Wolfram Burgard 1 Today This course Robotics

Introduction to Mobile Robotics Welcome Wolfram Burgard 1 Today This course Robotics in the past and today 2 Organization Self Study lecture recordings, no on-site lectures Thursday 13:00 14:00 homework, practical

1.05k views • 62 slides
The Human Factor: The critical importance of communication and effective teamwork in providing

The Human Factor: The critical importance of communication and effective teamwork in providing

10/20/2018 The Human Factor: The critical importance of communication and effective teamwork in providing excellent care . Anna K. Meyer, MD,FAAP, FACS Associate Professor Coach UCSF School of Medicine Facilitator, UCSF Center for Enhancement of

683 views • 24 slides

More recommend