The Design and Analysis of Set Problem

摘要

This thesis mainly elaborates on how to determine a set A from a group of data, it means that deleting repetitive elements and achieving inequality of set A. In this process, we used a fire-new thinking to delete the repetitive elements in a group of data, which makes every element can move to its final position at one-time. And then according to Set A determining a series of subsets, which takes the equipoise subset and balanced subset as the example. The algorithm to determine these two types of subsets can be extended to the algorithms to determine most other types of subsets.