数据结构考研分类复习真题 第五章 答案[15]

．这是一个递归调用问题运行结果为DBHEAIFJCKGL

（）FOR循环中每次执行PerfectShuffle(AN)和CompareExchange(AN)的结果

第次A[]=[]

A[]=[]

第次A[]=[]

A[]=[]

第次A[]=[]

A[]=[]

（）Demo的功能是将数组A中元素按递增顺序排序

（）PerfectShuffle 中WHILE循环内是赋值语句共N次WHILE外成组赋值语句相当N个简单赋值语句CompareExchange中WHILE循环内是交换语句最好情况下不发生交换最差情况下发生N次交换相当于N个赋值语句Demo中FOR循环循环次数logN故按赋值语句次数计算Demo的时间复杂度为最好情况O(N*logN)≈O(Nlog(*N))最差情况O((N+N)*logN)≈O(Nlog(*N))

[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []