[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fACT8sdOej45wBsWaJKSO9wMEAVReoCK64TZwXBJ1I-g":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2024-04-09 19:49:23",137545540,[8,9,10,11],"求一个序列中的最大连续子序列和","求一条迷宫路径","求一个序列中的最小元素","求二叉树的高度",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},41,"275e9e64f64491da611437cd86495060","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F48eba3395437dd881b1b9275a0ad1028.png","算法设计与分析","work_34055978","新建作业2024(4)","以下不可以采用分治法求解的问题是( )",[21,32,41,47,54,63,72,81,84,93],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],137545533,[25,26,27,28],"分治策略","贪心法","穷举法","回溯法","二分查找算法采用的是( )","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],137545534,[36,37,38,39],"求皇后问题","求两个整数相加的和","求一个点集中两个最近的点","求一个一元二次方程的根","以下适合采用分治法求解的问题是( )",{"answer":42,"createTime":5,"id":43,"options":44,"question":46,"source":30,"type":31},[],137545535,[25,45,26,28],"动态规划法","自顶向下的二路归并排序算法是基于( ) 的一种排序算法",{"answer":48,"createTime":5,"id":49,"options":50,"question":53,"source":30,"type":31},[],137545536,[51,52],"错误","正确","有人说分治算法只能采用递归实现,该观点( )",{"answer":55,"createTime":5,"id":56,"options":57,"question":62,"source":30,"type":31},[],137545537,[58,59,60,61],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F22bbacaa9c50a878ec145dce228e26f8.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ff5248e97c5acb17d2315c5e78711bd81.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ff2218c3879e00947a75abc6c5ec33f7d.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fe9f3f6b0a3a3484d7cfe19db2e64303c.png\">","使用二分查找算法在n个有序表中查找一个特定元素,在最好情况和最坏情况下的时间复杂度分别为( A )",{"answer":64,"createTime":5,"id":65,"options":66,"question":71,"source":30,"type":31},[],137545538,[67,68,69,70],"求图的单源最短路径","快速排序","求集合中第k大的元素","归并排序","以下不适合采用分治法求解的问题是( )",{"answer":73,"createTime":5,"id":74,"options":75,"question":80,"source":30,"type":31},[],137545539,[76,77,78,79],"(3,1,5,2,4)","(5,5,5,5,5)","(1,2,3,4,5)","(5,4,3,2,1)","设以下4个初始序列采用快速排序算法实现递增排序,其中( )所做的元素比较 数最少",{"answer":82,"createTime":5,"id":6,"options":83,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":85,"createTime":5,"id":86,"options":87,"question":92,"source":30,"type":31},[],137545541,[88,89,90,91],"对问题进行枚举","对问题进行分类","减小问题规模","对问题进行总结","分治法中分治的目的是( )",{"answer":94,"createTime":5,"id":95,"options":96,"question":97,"source":30,"type":31},[],137545542,[52,51],"以下二分查找算法是( )的. int binarySearch(int a[],int x){ \u002F\u002Fa 中的元素递增有序 int n=a.length; int low=0,high=n-1; while(low+1!=high) int mid=(low+high)\u002F2; if(x>=a_mid])low=mid; else high=mid; if(x==a[low])return low; else return -1; }"]