Анализ трудоемкости алгоритмов

Список использованных источников.#include Windows.hnamespace std;Tree.{:symbol;weight;* left_son;* right_son.Tree_vector; //дерево Хаффмана.{left_son = NULL;>right_son = NULL;_vector.push_back (tr).}Sort () //Сортировка эл-тов дерева по их весу.{= false; (int i=1;i.{ (Tree_vector [i] ->weight>Tree_vector [i-1] ->weight).{= Tree_vector [i] ;_vector [i] = Tree_vector [i-1] ;_vector [i-1] = temp;= true.} while (repeat).