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