Computer Science, asked by dhalsmita45, 9 months ago

the time complexity of human coding algorithm is

​

Answers

Answered by Anonymous
1

The time complexity of the Huffman algorithm is O(nlogn). Using a heap to store the weight of each tree, each iteration requires O(logn) time to determine the cheapest weight and insert the new weight. There are O(n) iterations, one for each item.

Previous Question
Next Question
Similar questions
Math, 4 months ago
18 - 12 ÷ 4 + 4 × 4 plz write steps of DMAS...
Science, 4 months ago
name the rocks and minerals​...
Hindi, 4 months ago
भाषा-ज्ञान (Language Knowledge) 1 समानार्थी शब्द लिखो- a, gehna b, path c, shish ​...
Computer Science, 9 months ago
Toupper () is a sql function. True or false ​...
Science, 9 months ago
when the iron loss and full load copper loss in a transformer are 900 w and 1600w respectively. the maximum efficiency occurs at ____ of full load ? a. 25% b. 50% c. 75% d. 100%​...
English, 1 year ago
Meena is....... Than sanju (tall)...
Math, 1 year ago
If w:0.80::9:6, W =? RRB NTPC 2016 (a) 2.5 (b) 1.1 (c) 3.3 (d) 1.2​...
English, 1 year ago
all the questions must be answered change into active​...