亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲蟲首頁| 資源下載| 資源專輯| 精品軟件
登錄| 注冊

SORT-merge

  • this is source code for counting sort algorith in c language

    this is source code for counting sort algorith in c language

    標簽: algorith counting language source

    上傳時間: 2017-09-24

    上傳用戶:asdkin

  • A sort of PacMan game wirtten in Visual Basic 6.0

    A sort of PacMan game wirtten in Visual Basic 6.0

    標簽: wirtten PacMan Visual Basic

    上傳時間: 2014-01-24

    上傳用戶:牧羊人8920

  • c語言算法排序

    1.Describe a Θ(n lg n)-time algorithm that, given a set S of n integers and another integer x, determines whether or not there exist two elements in S whose sum is exactly x. (Implement exercise 2.3-7.) #include<stdio.h> #include<stdlib.h> void merge(int arr[],int low,int mid,int high){      int i,k;      int *tmp=(int*)malloc((high-low+1)*sizeof(int));      int left_low=low;      int left_high=mid;      int right_low=mid+1;      int right_high=high;      for(k=0;left_low<=left_high&&right_low<=right_high;k++)      {      if(arr[left_low]<=arr[right_low]){                                        tmp[k]=arr[left_low++];                                        }      else{           tmp[k]=arr[right_low++];           } }             if(left_low<=left_high){                              for(i=left_low;i<=left_high;i++){                                                               tmp[k++]=arr[i];                                                               }                              }       if(right_low<=right_high){                              for(i=right_low;i<=right_high;i++)                                                                tmp[k++]=arr[i];                                                        }                              for(i=0;i<high-low+1;i++)                                                       arr[low+i]=tmp[i];       } void merge_sort(int a[],int p,int r){      int q;      if(p<r){              q=(p+r)/2;              merge_sort(a,p,q);              merge_sort(a,q+1,r);              merge(a,p,q,r);              }      } int main(){     int a[8]={3,5,8,6,4,1,1};     int i,j;     int x=10;     merge_sort(a,0,6);     printf("after Merging-Sort:\n");     for(i=0;i<7;i++){                      printf("%d",a[i]);                      }     printf("\n");     i=0;j=6;     do{                                    if(a[i]+a[j]==x){                                  printf("exist");                                  break;                                  }                  if(a[i]+a[j]>x)                                 j--;                  if(a[i]+a[j]<x)                                 i++;                       }while(i<=j);     if(i>j)              printf("not exist");     system("pause");     return 0;     }

    標簽: c語言 算法 排序

    上傳時間: 2017-04-01

    上傳用戶:糖兒水嘻嘻

  • 基于CPLD的QDPSK調(diào)制解調(diào)電路設計

    為了在CDMA系統(tǒng)中更好地應用QDPSK數(shù)字調(diào)制方式,在分析四相相對移相(QDPSK)信號調(diào)制解調(diào)原理的基礎上,設計了一種QDPSK調(diào)制解調(diào)電路,它包括串并轉(zhuǎn)換、差分編碼、四相載波產(chǎn)生和選相、相干解調(diào)、差分譯碼和并串轉(zhuǎn)換電路。在MAX+PLUSⅡ軟件平臺上,進行了編譯和波形仿真。綜合后下載到復雜可編程邏輯器件EPM7128SLC84-15中,測試結(jié)果表明,調(diào)制電路能正確選相,解調(diào)電路輸出數(shù)據(jù)與QDPSK調(diào)制輸入數(shù)據(jù)完全一致,達到了預期的設計要求。 Abstract:  In order to realize the better application of digital modulation mode QDPSK in the CDMA system, a sort of QDPSK modulation-demodulation circuit was designed based on the analysis of QDPSK signal modulation-demodulation principles. It included serial/parallel conversion circuit, differential encoding circuit, four-phase carrier wave produced and phase chosen circuit, coherent demodulation circuit, difference decoding circuit and parallel/serial conversion circuit. And it was compiled and simulated on the MAX+PLUSⅡ software platform,and downloaded into the CPLD of EPM7128SLC84-15.The test result shows that the modulation circuit can exactly choose the phase,and the output data of the demodulator circuit is the same as the input data of the QDPSK modulate. The circuit achieves the prospective requirement of the design.

    標簽: QDPSK CPLD 調(diào)制解調(diào) 電路設計

    上傳時間: 2014-01-13

    上傳用戶:qoovoop

  • 基于CPLD的QDPSK調(diào)制解調(diào)電路設計

    為了在CDMA系統(tǒng)中更好地應用QDPSK數(shù)字調(diào)制方式,在分析四相相對移相(QDPSK)信號調(diào)制解調(diào)原理的基礎上,設計了一種QDPSK調(diào)制解調(diào)電路,它包括串并轉(zhuǎn)換、差分編碼、四相載波產(chǎn)生和選相、相干解調(diào)、差分譯碼和并串轉(zhuǎn)換電路。在MAX+PLUSⅡ軟件平臺上,進行了編譯和波形仿真。綜合后下載到復雜可編程邏輯器件EPM7128SLC84-15中,測試結(jié)果表明,調(diào)制電路能正確選相,解調(diào)電路輸出數(shù)據(jù)與QDPSK調(diào)制輸入數(shù)據(jù)完全一致,達到了預期的設計要求。 Abstract:  In order to realize the better application of digital modulation mode QDPSK in the CDMA system, a sort of QDPSK modulation-demodulation circuit was designed based on the analysis of QDPSK signal modulation-demodulation principles. It included serial/parallel conversion circuit, differential encoding circuit, four-phase carrier wave produced and phase chosen circuit, coherent demodulation circuit, difference decoding circuit and parallel/serial conversion circuit. And it was compiled and simulated on the MAX+PLUSⅡ software platform,and downloaded into the CPLD of EPM7128SLC84-15.The test result shows that the modulation circuit can exactly choose the phase,and the output data of the demodulator circuit is the same as the input data of the QDPSK modulate. The circuit achieves the prospective requirement of the design.

    標簽: QDPSK CPLD 調(diào)制解調(diào) 電路設計

    上傳時間: 2013-10-28

    上傳用戶:jyycc

  • 產(chǎn)品檢測中裕度和校準的樂趣

    Abstract: This application note presents an overview of electronic margining and its value in detectingpotential system failures before a product ships from the factory. It is a calibration method that effectivelypredicts and allows adjustments to improve product quality. Margining also can be used to sort productsinto performance levels, allowing premium products to be sold at premium prices. We discuss thedownside of sorting and suggest alternative ways to segregate products.

    標簽: 產(chǎn)品檢測 校準

    上傳時間: 2014-01-22

    上傳用戶:lhw888

  • 插入算法

    插入算法,英文叫作insertion sort

    標簽: 算法

    上傳時間: 2015-01-29

    上傳用戶:英雄

  • Addressbook using double-linked list. This example shows the use of a double-linked list by implemen

    Addressbook using double-linked list. This example shows the use of a double-linked list by implementing an addressbook for the console. It has features like inserting, searching(linear), sorting(bubble sort), deleting and load/save to a file. I wrote this during my study of Applied Computer Science so it s intended mainly for students who want to know about some advanced programming techniques in C. The Code was compiled with MSVC++ 6.0 but it should compile with any ANSI-compliant compiler.

    標簽: double-linked list Addressbook implemen

    上傳時間: 2014-01-24

    上傳用戶:asddsd

  • Use the verilog language write a MIPS CPU code, and have additional instruction, for example: select

    Use the verilog language write a MIPS CPU code, and have additional instruction, for example: selection sort instruction. The code has contain combination circuit and sequenial circuit. CPU have contain ALU, ADD, ALU_CONTROL, DATA_MEMORY, INST_MEMORY, REGISTER, PC, and TESTBRANCH.

    標簽: instruction additional language example

    上傳時間: 2014-01-17

    上傳用戶:yyyyyyyyyy

  • 分而治之方法還可以用于實現(xiàn)另一種完全不同的排序方法

    分而治之方法還可以用于實現(xiàn)另一種完全不同的排序方法,這種排序法稱為快速排序(quick sort)。在這種方法中, n 個元素被分成三段(組):左段l e f t,右段r i g h t和中段m i d d l e。中段僅包含一個元素。左段中各元素都小于等于中段元素,右段中各元素都大于等于中段元素。因此l e f t和r i g h t中的元素可以獨立排序,并且不必對l e f t和r i g h t的排序結(jié)果進行合并。m i d d l e中的元素被稱為支點( p i v o t )。圖1 4 - 9中給出了快速排序的偽代碼

    標簽: 排序

    上傳時間: 2015-04-27

    上傳用戶:kristycreasy

主站蜘蛛池模板: 安康市| 周宁县| 溧水县| 安吉县| 陈巴尔虎旗| 白河县| 苗栗市| 木兰县| 荆门市| 新余市| 抚州市| 泸州市| 治县。| 合肥市| 丁青县| 蒙山县| 昌图县| 华宁县| 隆化县| 新疆| 易门县| 五大连池市| 高唐县| 芜湖市| 邻水| 叶城县| 札达县| 清徐县| 梁河县| 叶城县| 浦北县| 枣阳市| 呼玛县| 叶城县| 宁德市| 察雅县| 图木舒克市| 徐州市| 滨海县| 古丈县| 柳河县|