Computer Science, asked by dhalsmita45, 4 months ago

the time complexity of human coding algorithm is

Answers

Answered by Anonymous

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

Biology, 2 months ago

what is specialized respiratory surface and what is its advantages ...

English, 2 months ago

You are Tanvi of sunrise Public School Delhi you lost your library card in the school write a notice to be put on the school notice board in about 50...

India Languages, 2 months ago

सन्धिं कुरुत- ग्रीष्म + ऋतौ ग्रीष्मृतौ ग्रीष्मर्तौ ग्रीष्मतौ...

Computer Science, 4 months ago

Toupper () is a sql function. True or false ...

Science, 4 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, 8 months ago

Meena is....... Than sanju (tall)...

Math, 8 months ago

If w:0.80::9:6, W =? RRB NTPC 2016 (a) 2.5 (b) 1.1 (c) 3.3 (d) 1.2...

English, 8 months ago

all the questions must be answered change into active...

the time complexity of human coding algorithm is​

Answers

the time complexity of human coding algorithm is