学堂在线清华大学数据结构(下)(2021春)课后作业题答案
- next[0] = A-1 B0 C1 D2 2021-06-19
- In the KMP algorithm, when a comparison fails at P[j] (the jth charact 2021-06-19
- Who is not among the inventors of KMP? 下面哪位不是KMP算法的发明者: AK 2021-06-19
- The Brute-force algorithm runs in _______ time for a pattern string an 2021-06-19
- n is the length of the text and m is the length of the pattern. In mos 2021-06-19
- The structure of a string is just like a 字符串在结构上相当于: Avector 2021-06-19
- Spatial complexity (excluding the space occupied by the input itself) 2021-06-19
- The time complexity of heap sorting is: 堆排序的时间复杂度为: AO(n) BO 2021-06-19
- And which sort has the asymptotic time complexity with it? 而在渐进时 2021-06-19
- Heap sorting is similar to what sort of sorting you learned in the pro 2021-06-19
- Time complexity is: 时间复杂度为: AO(lgn) BO(n) CO(nlgn) DO(n^2) 2021-06-19
- If use Floyd method 若使用Floyd算法 The whole process is:整个过程是: A 2021-06-19
- The time complexity is: 时间复杂度为: AO(lgn) BO(n) CO(nlgn) DO(n^2) 2021-06-19
- Existing n elements need to be organized into a complete binary stack 2021-06-19
- The current complete binary heap is physically {10, 5, 8, 3, 2, 7} as 2021-06-19
- The current complete binary heap is physically {10, 5, 8, 3, 2, 7} as 2021-06-19
- In the complete binary stack (biggest node in the root), it is incorre 2021-06-19
- A complete binary heap is physically a vector and its stored order of 2021-06-19
- The overall form of the complete binary tree: 完全二叉树从整体上看的形 2021-06-19
- The stack is a special case of priority queues where the element's pri 2021-06-19
- Which of the following data structures is used to implement the priori 2021-06-19
- Combining the leftist heaps A and the leftist heaps B, where the large 2021-06-19
- The meaning of left is 左倾的意义是 AThe right child's NPL of any node 2021-06-19
- The meaning of the left heap relative to a full binary heap is: 相对于 2021-06-19
- How to use the heap to sort: 如何用堆来实现排序: AContinue to call delM 2021-06-19