java实现数据结构06.03（集合详解代码之二分搜索树集合与链表集合执行效率比较）

超、凢脫俗 2023-06-23 03:56 11阅读 0赞

## 阅读本文章前请先阅读[java实现数据结构06.01（集合详解代码之自定义基于二分搜索树的集合）][java_06.01]和[java实现数据结构06.02（集合详解代码之自定义基于链表的集合）][java_06.02] ##

## main测试： ##

import java.util.ArrayList;
    
    public class Main {
    
        /**
         * 测试集合运行效率
         * @param set 测试的集合
         * @param fileName 测试的文件名
         * @return 返回测试耗时，单位为秒
         */
        private static double testSet(Set<String> set,String fileName){
            long beginTime = System.nanoTime();
            Array<String> array=new Array<>();
            FileOperation.readFile(fileName,array);
            System.out.println("pride-and-prejudice");
            for (int i = 0; i < array.getSize(); i++) {
                set.add(array.get(i));
            }
            System.out.println("Total words:"+array.getSize());
            System.out.println("Different words:"+set.getSize());
            long overTime = System.nanoTime();
            return (overTime-beginTime)/1000000000.0;
        }
    
        public static void main(String[] args) {
            String fileName="pride-and-prejudice.txt";
            //二分搜索树集合
            BSTSet<String> bstSet=new BSTSet<>();
            System.out.println("BSTSet time:"+testSet(bstSet,fileName)+"s");
    
            System.out.println("----------------------------------------------------------------------");
    
            //链表集合
            LinkedListSet<String> linkedListSet=new LinkedListSet<>();
            System.out.println("LinkedListSet time:"+testSet(linkedListSet,fileName)+"s");
        }
    }

## 测试结果： ##

> pride-and-prejudice  
> Total words:125901  
> Different words:6530  
> BSTSet time:0.1499261s

> pride-and-prejudice  
> Total words:125901  
> Different words:6530  
> LinkedListSet time:0.397332s

## 可知二分搜索树集合比链表集合的执行效率高 ##

[java_06.01]: https://blog.csdn.net/liangruilz/article/details/103578355
[java_06.02]: https://blog.csdn.net/liangruilz/article/details/103578771