计数：就是将线性表按频率来排列，频率高的放在前面，频率低的放到后面。
移至前端：将每次访问的元素都放到最前面，之前在它前面的都向后移一位。
转置：将访问的元素和前面的一个元素交换位置。
《数据结构和算法分析》（第二版）9.6题。
代码：
#include<iostream>
using namespace std;
void count(int list[], int array[])
{
int count = 0;
int rate[8];
for (int i = 0; i < 8; i++)
rate[i] = 0;
for (int i = 0; i < 15; i++)
{
for (int j = 0; j < 8; j++)
{
if (array[i] == list[j])
{
count += j + 1;
rate[j]++;
if (rate[j] <= rate[j - 1])
break;
else
{
for (int k = j; k > 0; k--)
{
if (rate[k] > rate[k - 1])
{
int temp = list[k];
list[k] = list[k - 1];
list[k - 1] = temp;
temp = rate[k];
rate[k] = rate[k - 1];
rate[k - 1] = temp;
}
}
break;
}
}
}
}
cout << "访问的次数：" << count << endl;
cout << "计数后的顺序:";
for (int i = 0; i < 8; i++)
{
printf("%c ", (65 + list[i]));
}
cout << endl << endl;;
}
void MoveToStart(int list[], int array[])
{
int count = 0;
for (int i = 0; i < 15; i++)
{
for (int j = 0; j < 8; j++)
{
if (array[i] == list[j])
{
count += j + 1;
if (j == 0)
break;
else
{
int m = list[j];
for (int k = j; k > 0; k--)
{
list[k] = list[k - 1];
}
list[0] = m;
}
}
}
}
cout << "访问的次数：" << count << endl;
cout << "移至前端的顺序:";
for (int i = 0; i < 8; i++)
{
printf("%c ", (65 + list[i]));
}
cout << endl << endl;;
}
void exchange(int list[], int array[])
{
int count = 0;
for (int i = 0; i < 15; i++)
{
int m=array[i];
for (int j = 0; j < 8; j++)
{
int n=list[j];
if (array[i] == list[j])
{
count += j + 1;
if (j == 0)
break;
else
{
int temp = list[j-1];
list[j - 1] = list[j];
list[j] = temp;
break;
}
}
}
}
cout << "访问的次数：" << count << endl;
cout << "转置后的顺序：";
for (int i = 0; i < 8; i++)
{
printf("%c ", (65 + list[i]));
}
cout << endl << endl;;
}
int main()
{
int list[8];
for (int i = 0; i < 8; i++)
list[i] = i;
int array[15] = { 3,7,7,6,7,4,6,7,6,7,4,2,4,7,6 };
exchange(list, array);
for (int i = 0; i < 8; i++)
list[i] = i;
MoveToStart(list, array);
for (int i = 0; i < 8; i++)
list[i] = i;
count(list, array);
}
实现：
：