The software package provides a MAX-MIN Ant System implemented in the
Hyper-Cube Framework for the application to Unconstrained Binary Quadratic
Programming (UBQP).
This code implements min binomial heaps and min leftist trees.Plus, measure and compare the relative performance of these two implementations under the assumption that the only permissible operations are insert and delete-min.
Ex3-23 亲兄弟问题
« 问题描述：
给定n 个整数0 1 1 , , , n- a a  a 组成的序列。序列中元素i a 的亲兄弟元素k a 定义为：
min{ | } k i j n j j i a = a a ³ a
< <
。
亲兄弟问题要求给定序列中每个元素的亲兄弟元素的位置。元素i a 的亲兄弟元素为k a
时，称k 为元素i a 的亲兄弟元素的位置。当元素i a ...
