写在前面sort是排序工具，它完美贯彻了Unix哲学："只做一件事，并做到完美"。

publicclassShellSort{publicstaticvoidmain(String[]args){int[]value={9,1,2,5,7,4,8,6,3,5};newShellSort().sort

OverridepublicResponseResultlistComments(intpage,intsize){page=checkPage(page);size=checkSize(size);Sortsort=newSort(Sort.Direction.DESC

,"createTime");Pageablepageable=PageRequest.of(page-1,size,sort);Page<ArticleNoContent>

OverridepublicResponseResultlistCommentByArticleId(StringarticleId,intpage,intsize){page=checkPage(page);size=checkSize(size);Sortsort=newSort(Sort.Direction.DESC

1.12.1</version></dependency>html转文字Jsoup.parse(html内容).text()查询q：query查询fq：filterquery过滤查询sort

Constants.Page.DEFAULT_PAGE;}if(size<Constants.Page.DEFAULT_SIZE){size=Constants.Page.DEFAULT_SIZE;}Sortsort=newSort(Sort.Direction.DESC

轮编码第一轮排序代码:publicclassbubbleSort{publicstaticvoidmain(String[]args){int[]value={3,6,4,1,2};newbubbleSort().sort

Java-数据结构和算法-选择排序(selectionsort)选择排序哦，前一篇是冒泡排序Java-数据结构和算法-冒泡排序(bubblesort)选择排序怎么个选择法呢？描述我们遍历数据，每次选择出最小的数，排到当前开始遍历的位置。下一次遍历从下一个元素开始，真到倒数第二个元素即可排序完成代码实现publicclassSelectSort{publicstaticvoidmain(String[]args){int[]data=newint[]{344,4,345,23,566,456,34,5,78,45,23,56673};for(inti=0;i<data.length-1;i++){intcurrent=data[i];for(intj=i+1;j<data.length;j++){if(current>data[j]){inttemp=current;current=data[j];data[j]=temp;}}data[i]=current;for(inth=0;h<data.length;h++){System.out.print(data[h]+",");}System.out.println();}}}图解我懒得去画了，这是输出的结果4,344,345,23,566,456,34,5,78,45,23,56673,4,5,345,344,566,456,34,23,78,45,23,56673,4,5,23,345,566,456,344,34,78,45,23,56673,4,5,23,23,566,456,345,344,78,45,34,56673,4,5,23,23,34,566,456,345,344,78,45,56673,4,5,23,23,34,45,566,456,345,344,78,56673,4,5,23,23,34,45,78,566,456,345,344,56673,4,5,23,23,34,45,78,344,566,456,345,56673,4,5,23,23,34,45,78,344,345,566,456,56673,4,5,23,23,34,45,78,344,345,456,566,56673,4,5,23,23,34,45,78,344,345,456,566,56673,

交换第一个索引的值和最小值的索引的值第一轮遍历代码publicclassSelectSort{publicstaticvoidmain(String[]args){int[]value={3,6,4,1,2};newSelectSort().sort

publicclassInsertionSort{publicstaticvoidmain(String[]args){int[]value={3,6,4,1,2};newInsertionSort().sort

Java-数据结构和算法-插入排序(insertionsort)相关文章接下来我们看看插头排序插入排序我打牌一般不输，我有一个跟输赢无关的习惯。就是牌会按大小顺序排列。从摸牌，再到排序这么一个过程，其实就是插入排序。算法描述插入排序分为两组数据，已经排序的数据，等待排序的数据从等待排序的数据，向已经排序的数据中对比插入代码实现我这里偷懒，用了一下集合publicclassMain{publicstaticvoidmain(String[]args){int[]data=newint[]{344,4,345,23,566,456,34,5,78,45,23,56673};//我们使用集合比较方便插入，当然啦，集合直接就有工具类去排序了。List<Integer>sortedData=newArrayList<>();for(inti=0;i<data.length;i++){intcurrent=data[i];insert(sortedData,current);output(sortedData);}output(sortedData);}privatestaticvoidinsert(List<Integer>sortedData,intcurrent){//如果size为0，直接插入，不需要进行比较if(sortedData.size()==0){sortedData.add(current);}elseif(sortedData.size()==1){if(current>sortedData.get(0)){sortedData.add(current);}else{sortedData.add(0,current);}}else{for(inti=0;i<sortedData.size();i++){if(current<sortedData.get(i)){sortedData.add(i,current);break;}if(i==sortedData.size()-1){//sortedData.add(current);break;}}}}privatestaticvoidoutput(List<Integer>data){System.out.print("[");for(Integerdatum:data){System.out.print(""+datum+"");}System.out.println("]");}}那用数组怎么写呢？publicclassMainTwo{publicstaticvoidmain(String[]args){int[]data=newint[]{344,4,345,23,566,456,34,5,78,45,23,56673};//默认值全为0int[]sortData=newint[data.length];for(inti=0;i<data.length;i++){//取数据intcurrent=data[i];output(sortData);//插入到数组里insert(sortData,current,i);output(sortData);}}privatestaticvoidinsert(int[]sortData,intcurrent,intindex){//index表示已经插入了多少个嘛if(index==0){sortData[0]=current;}else{//比大小for(inti=0;i<index;i++){if(current<sortData[i]){inttmp=sortData[i];sortData[i]=current;//就在i这个地方了for(intj=i+1;j<=index;j++){intnext=sortData[j];sortData[j]=tmp;tmp=next;}break;}if(i==index-1){//放到最后面去了sortData[index]=current;}}}}privatestaticvoidoutput(int[]data){System.out.print("[");for(intdatum:data){System.out.print(datum+"");}System.out.println("]");}}单数组实现publicclassInsertionSort{publicstaticvoidmain(String[]args){int[]data=newint[]{344,4,345,23,566,456,34,5,78,45,23,56673};//从第二个开始遍历每一个元素for(inti=1;i<data.length;i++){//拿到要排序的元素inttarget=data[i];//所有的元素往后移动，直到target找到合适的位置intj=i-1;//j表示已经排序的数量while(j>=0&&target<data[j]){//数据往右移动//data[j+1]第一个就是data[i]data[j+1]=data[j];j--;}data[j+1]=target;}}}排序结果集合写的排序结果用数据写的结果：

Java-数据结构和算法-冒泡排序(bubblesort)连概述都懒得写了，直接写相关的代码和说明吧一般来说，按大学的套路，先有导论，然后有概述，听得大家都睡觉了。冒泡排序原始数据[344,566,4,345,23,56673,456,34,5,78,45,23]我们希望从小到大排序算法描述取出第一个数据，与下一个数据进行比较，如果比它大，则交换位置，一直到最后一个，如此确保了最后一个是最大的数取出第一个数据，与一下下数据进行比较，如果比它大，则交换位置，一直到倒数第二个，如果确保了倒数第二个是第二大的数。.....第一轮排序第二轮排序，比对到倒数第二个即可，因为我们第一轮对比已经确保了最大的在最右边了。第三轮排序第四轮排序第五轮排序代码publicclassBubbleSort{publicstaticvoidmain(String[]args){int[]data=newint[]{344,566,4,345,23,56673,456,34,5,78,45,23};for(inti=0;i<data.length-1;i++){for(intj=0;j<data.length-i-1;j++){intleft=data[j];intright=data[j+1];if(left>right){inttemp=left;data[j]=right;data[j+1]=temp;}}for(inth=0;h<data.length;h++){System.out.print(data[h]+",");}System.out.println("");}}}代码狗屎一样，是吧！哈哈，看后面的结果输出吧！图解344,4,345,23,566,456,34,5,78,45,23,56673,4,344,23,345,456,34,5,78,45,23,566,56673,4,23,344,345,34,5,78,45,23,456,566,56673,4,23,344,34,5,78,45,23,345,456,566,56673,4,23,34,5,78,45,23,344,345,456,566,56673,4,23,5,34,45,23,78,344,345,456,566,56673,4,5,23,34,23,45,78,344,345,456,566,56673,4,5,23,23,34,45,78,344,345,456,566,56673,4,5,23,23,34,45,78,344,345,456,566,56673,4,5,23,23,34,45,78,344,345,456,566,56673,4,5,23,23,34,45,78,344,345,456,566,56673,太多了，我就不画图了，理解就好。就是每一次交换，保证了大的在左边。如此遍历下来，即可完成排序，但是感觉效率不咋滴呀，如果数据量非常大的话，循环下来，则时间维度非常大。

returnloopService.listLoops();}代码公用，判断角色和是否登录即可@OverridepublicResponseResultlistLoops(){Sortsort=newSort(Sort.Direction.DESC

articlelistfirstpagefromredis");returnResponseResult.SUCCESS("获取文章列表成功").setData(result);}//创建分页和排序Sortsort=newSort(Sort.Direction.DESC

nbsp; "pageable": {            "sort

size")intsize){if(page<1){page=1;}if(size<=0){size=Constants.DEFAULT_SIZE;}Sortsort=newSort(Sort.Direction.DESC

Constants.Page.DEFAULT_PAGE;}if(size<Constants.Page.DEFAULT_SIZE){size=Constants.Page.DEFAULT_SIZE;}//创建条件Sortsort=newSort(Sort.Direction.DESC

Constants.Page.DEFAULT_PAGE;}if(size<Constants.Page.DEFAULT_SIZE){size=Constants.Page.DEFAULT_SIZE;}//创建条件Sortsort=newSort(Sort.Direction.DESC

o.getName().endsWith(".avi")));fileList.sort((o1,o2)->{Stringo1Name=o1.getName();Stringo2Name

[集合名称].find().sort({name:1,age:1});#1:升序-1：降序orderbyname,age#分页db.

publicResponseResultlistLoops(){returnloopService.listLoops();}接口实现@OverridepublicResponseResultlistLoops(){Sortsort=newSort(Sort.Direction.DESC

Modifyingmethodmustnotcontain[interfaceorg.springframework.data.domain.Pageable,classorg.springframework.data.domain.Sort

publicclassMergeSort{publicstaticvoidmain(String[]args){int[]value={8,4,5,7,1,3,6,2};newMergeSort().sort

主要的相关参数如下：dataset:加载的数据集batch_size：batch大小batch_size_fn：产生动态的batch大小的函数sort_key：排序的keytrain：是否是一个训练集repeat

Integer>>threeSum(int[]nums){List<List<Integer>>res=newArrayList<>();Arrays.sort

searchWord = hotWord.getSearchword(); hotWords.add(searchWord); } Collections.sort

userService.checkSobUser();if(sobUser==null){returnResponseResult.ACCOUNT_NOT_LOGIN();}//创建分页条件Sortsort=newSort(Sort.Direction.DESC

i-1))));//3、第i个拒绝，第i+1个接受//==>3*i+1perAdditaion.add(perAdditaion.get(3*i)+data[i]);}}Collections.sort