love208e的专栏

在一个由元素组成的表中，出现次数最多的元素成为众数。试写一个寻找中枢的算法，并分析其计算复杂性。 输出众数和该众数的重数。 算法流程： 1、 用快速排序算法QuickSort()先将数组排序； 2、 用数组b[]存储每个不同的数字出现的次数； 3、 求b[]数组中最大值，即为众数的重数； 4、 输出众数和重数；如果没有众数，则输出没有众数提示。

======================================================================== WebPageLoader ======================================================================== WebPageLoader is an internet offline download utility. It will download a complete internet web page or a range of image files. It is aimed at graphics download - not for downloading complete sites. There are plenty of site download spiders out there. Many are quite good and most of them are shareware. This utility specializes in downloading files - or series of files. A splendid example is a web site that contains several files of interest: ThePolice_s001.mp3 ThePolice_s002.mp3 ThePolice_s003.mp3 ... ThePolice_s021.mp3 WebPageLoader can easily be configured to automatically download all 21 files using a simple wizard. You may also decide to download the entire page and all its contents.

实验二_用表格形式显示字符 datarea segment datarea ends prognam segment main proc far assume cs:prognam,ds:datarea start: push ds sub ax,ax push ax mov ax,datarea mov ds,ax mov es,ax mov dl,10h mov ch,0 next0: mov cl,0 next1: mov ah,02h int 21h push dx mov ah,02h mov dl,0 int 21h pop dx inc dl inc cl next2: cmp cl,16 jne next1 push dx mov ah,02h mov dl,0dh int 21h mov ah,02h mov dl,0ah int 21h pop dx inc ch cmp ch,15 jne next0 ret main endp prognam ends end start