一种基于选择排序的快速求核算法

摘要

关于求核的算法有很多，本研究利用选择排序的思想设计了求解等价类的算法，其时间复杂度为O(|C||U|)。在此基础上，设计的求核算法，算法时间复杂度为O(|C|^(2)|U|)。通过实验，证明了算法的正确性和高效性。%There are many algorithms for computing the core. We design an algorithm for obtaining the equivalence class using the selection sort,whose time complexity is O (|C|U|). Based on it,we design an algorithm for computing the core,whose time complexity is O(|C|^(2)|U|). The experiment result shows the algorithm is correct and efficient.