govnocode, C++ (vc++)

Language: Layout:

#include <iostream>
#include <vector>
#include <list>
#include <map>
#include <iterator>

#include <cassert>

using namespace std;

class Node {

public:
	int a = 0;
	char c = 0;
	Node *left = nullptr;
    Node *right = nullptr;

bool operator< (const Node& t) const { return a < t.a; }

Node(){};

Node(Node *L, Node *R)
	{
        assert(L);
        assert(R);
        
		left  = L;
		right = R;
		a = L->a + R->a;
	}

};

struct Compare {

bool operator() (Node *l, Node *r) const
	{
        assert(l);
        assert(r);
		return l->a < r->a;
	}
};

void traversal(Node* root, unsigned k)
{
	if (root)
	{
		for (unsigned i = 0; i < k; i++)
			cout << " ";

assert(root->a);
        if (root->c) 
            cout << root->a << " (" << root->c << ")" << endl;
		else 
            cout << root->a << endl;

traversal(root->left , k + 3);
		traversal(root->right, k + 3);

}

vector<bool> code;
map<char, vector<bool> > table;

void buildTable(Node *root)
{
    assert(root);
    
	if (root->left)
		code.push_back(0),
		buildTable(root->left);

if (root->right)
		code.push_back(1),
		buildTable(root->right);

if (root->c) 
        table[root->c] = code;
    
    if(!code.empty())
	    code.pop_back();
}

int main()
{
	string s = "my son is my sun!";

map<char, int> M;

for (int i = 0; i < s.length(); i++)
		M[s[i]]++;

list<Node*> Tree;

map<char, int>::iterator M_itr;

for (M_itr = M.begin(); M_itr != M.end(); ++M_itr)
    {
		Node* one = new Node;
		one->c = M_itr->first;
		one->a = M_itr->second;
		Tree.push_back(one);
    }

list<Node*>::iterator L_itr;

for (L_itr = Tree.begin(); L_itr != Tree.end(); L_itr++)
	{
        assert((*L_itr)->c);
        assert((*L_itr)->a);
		cout << (*L_itr)->c << ":" << (*L_itr)->a << endl;
	}

while (Tree.size() != 1)
	{
		Tree.sort(Compare());

Node *son_L = Tree.front();
		Tree.pop_front();

Node *son_R = Tree.front();
		Tree.pop_front();

Node *parent = new Node(son_L, son_R);

Tree.push_back(parent);
	}

Node* root = Tree.front();

traversal(root, 0);
	buildTable(root);
    
	for (int i = 0; i<s.length(); i++)
	{
		vector<bool> t = table[s[i]];
		vector<bool>::iterator V;

for (V = t.begin(); V != t.end(); V++)
			cout << *V;
	}
}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 1,91 sec, absolute running time: 0,33 sec, absolute service time: 2,25 sec