-->
当前位置:首页 > Luz 第6658页
Luz

Luz 管理员

暂无介绍

89859 篇文章 33 次评论

判断某个算法是否容易阅读是算法分析的任务之一。

Luz5年前 (2021-05-10)1240
判断某个算法是否容易阅读是算法分析的任务之一。 ~@[](2)答案:FALSE…

In a hash table, "synonyms"(同义词) means two elements being hashed

Luz5年前 (2021-05-10)1030
In a hash table, "synonyms"(同义词) means two elements being hashed into the same slot by two different hash functions. ~@[…

In a hash table, "synonyms"(同义词) means two elements sharing the

Luz5年前 (2021-05-10)963
In a hash table, "synonyms"(同义词) means two elements sharing the same hash value. ~@[](1)答案:TRUE…

Store $$M$$ elements in a hash table which is represented by an

Luz5年前 (2021-05-10)1252
Store $$M$$ elements in a hash table which is represented by an array of size $$S$$, the loading density is then $$M/S$$…

To sort $$N$$ records by quick sort, the worst-case time complex

Luz5年前 (2021-05-10)878
To sort $$N$$ records by quick sort, the worst-case time complexity is $$O(NlogN)$$. ~@[](1)答案:FALSE…

Shell sort is stable.

Luz5年前 (2021-05-10)1916
Shell sort is stable. ~@[](1)答案:FALSE…

To sort $$N$$ records by merge sort, the number of merge runs is

Luz5年前 (2021-05-10)1056
To sort $$N$$ records by merge sort, the number of merge runs is $$O(NlogN)$$. ~@[](2)答案:FALSE…

To sort $$N$$ distinct records by bubble sort, the number of rec

Luz5年前 (2021-05-10)963
To sort $$N$$ distinct records by bubble sort, the number of record swaps must reach its maximum when the original seque…

To sort $$N$$ records by simple selection sort, the numbers of c

Luz5年前 (2021-05-10)1166
To sort $$N$$ records by simple selection sort, the numbers of comparisons and record movements are $$O(N^2)$$ and $$O(N…

The sum of the degrees of all the vertices in a connected graph

Luz5年前 (2021-05-10)909
The sum of the degrees of all the vertices in a connected graph must be an even number. ~@[](1)答案:TRUE…