2015级计科软件《数据结构与算法》实践能力专题训练8排序

最新推荐文章于 2025-06-22 18:23:40 发布

原创最新推荐文章于 2025-06-22 18:23:40 发布 · 385 阅读

0 ·

CC 4.0 BY-SA版权

小组成员练习题专栏收录该内容

13 篇文章

订阅专栏

本文汇总了多种排序算法的实现，包括快速排序、交换排序、桶排序等，并提供了详细的代码示例。通过这些示例，读者可以更好地理解各种排序算法的工作原理。

数据结构实验之排序一：一趟快排

#include <cstring>
#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;

int a[100005];

void Sort(int left, int right)
{
    if ( left >= right )
        return ;
    int i = left, j = right;
    int key = a[left];
    while ( i < j )
    {
        while ( i < j&&key <= a[j] )
            j--;
        a[i] = a[j];
        while ( i < j&&key >= a[i] )
            i++;
        a[j] = a[i];
    }
    a[i] = key;
}

int main()
{
    int n, i;
    while ( ~scanf ( "%d", &n ) )
    {
        for ( i = 0;i < n; i++ )
            scanf ( "%d", &a[i] );
        Sort(0, n-1);
        for ( i = 0;i < n; i++ )
            printf ( i != n-1 ? "%d " : "%d\n", a[i] );
    }
}

数据结构实验之排序二：交换排序

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <math.h>
using namespace std;
int a[100002];
int b[100002];
int sum1;
int sum2;
void sort1(int l,int r)
{
    if(l >= r)
        return ;
    int i = l,j = r;
    int key = a[l];
    while(i < j)
    {
        while(i < j&&key <= a[j])
            j--;
        if(a[i] != a[j])
            sum2++;
        a[i] = a[j];
        while(i < j&&key >= a[i])
            i++;
        if(a[i] != a[j])
            sum2++;
        a[j] = a[i];
    }
    a[i] = key;
    sort1(l,i-1);
    sort1(i+1,r);
}
void bubble(int n)
{
    int i,j,temp;
    for(i = 0;i < n-1; i++)
    {
        for(j = 0;j < n-i-1;j++)
        {
            if(b[j] > b[j+1])
            {
                temp = b[j];
                b[j] = b[j+1];
                b[j+1] = temp;
                sum1++;
            }
        }
    }
}
int main()
{
    int n,i;
    while(~scanf("%d",&n))
    {
        for(i = 0;i < n; i++)
        {
            scanf("%d",&a[i]);
            b[i] = a[i];
        }
        sum1 = 0;
        sum2 = 0;
        bubble(n);
        sort1(0,n-1);
        printf("%d %d\n",sum1,sum2);
    }
}

数据结构实验之排序三：bucket sort

#include <cstring>
#include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;

int main()
{
    int a[150];
    int n, m, i;
    memset ( a, 0, sizeof(a) );
    scanf ( "%d", &n );
    while ( n-- )
    {
        scanf ( "%d", &m );
        if ( m >= 100 )
            m = 100;
        a[m]++;
    }
    for ( i = 0;i < 150; i++ )
    {
        if ( a[i] != 0 )
            printf ( "%d %d\n", i, a[i] );
    }
    return 0;
}

数据结构实验之排序四：寻找大富翁

这个题我就不贴代码了，因为我AC的代码不一定对，我做这个题是碰运气，希望测试你的程序后台给的数据很弱，那你就能过。好运！！！

数据结构实验之排序五：归并求逆序数

#include <string.h>
#include <stdio.h>
#include <iostream>
using namespace std;

int s[100005];
long long sum; //要用long long才能过的

void comput( int s[], int top, int mid, int en )
{
    int left_size = mid - top +1;
    int right_size = en - mid;
    int LEFT[left_size+1];
    int RIGHT[right_size+1];
    for( int i = 0;i < left_size; i++ )
    {
        LEFT[i] = s[top+i];
    }
    for( int i = 0;i < right_size; i++ )
    {
        RIGHT[i] = s[mid+i+1];
    }
    int i = 0;
    int j = 0;
    int k = top;
    while(i < left_size && j < right_size )
    {
        if( LEFT[i] > RIGHT[j] )
        {
            s[k++] = RIGHT[j++];
            sum = sum+mid-i-top+1;
        }
        else
        {
            s[k++] = LEFT[i++];
        }
    }
    while ( j < right_size ) s[k++] = RIGHT[j++];
    while ( i < left_size ) s[k++] = LEFT[i++];
    return ;
}

void mergesort( int s[], int top, int en )
{
    if( top != en )
    {
        int mid = ( top + en ) / 2;
        mergesort( s, top, mid );
        mergesort( s, mid+1, en );
        comput( s, top, mid, en );
    }
    return ;
}

int main()
{
    int n,i;
    scanf ( "%d", &n );
    sum = 0;
    for( i = 0; i < n; i++ )
    {
        scanf ( "%d", &s[i] );
    }
    mergesort( s, 0, n-1 );
    printf ( "%lld\n", sum );
    return 0;
}

数据结构实验之排序六：希尔排序

#include <cstring>
#include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;

int a[10002], n;

void Shell(int p, int r, int d)
{
    int i, j;
    for ( i = p+d;i <= r; i++ )
    {
        int temp = a[i];
        j = i-d;
        while ( j >= p&&temp < a[j] )
        {
            a[j+d] = a[j];
            j = j-d;
        }
        a[j+d] = temp;
    }
}

int main()
{
    int i;
    while ( ~scanf ( "%d", &n ) )
    {
        for ( i = 1;i <= n; i++ )
            scanf ( "%d", &a[i] );
        Shell(1, n, n/2);
        for ( i = 1;i <= n; i++ )
            printf ( i != n ? "%d " : "%d\n" , a[i] );
        Shell(1, n, 1);
        for ( i = 1;i <= n; i++ )
            printf ( i != n ? "%d " : "%d\n" , a[i] );
    }
}

数据结构实验之排序七：选课名单

两种方式

一种是用vector数组，另一种很常规

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

struct node
{
    char ch[20];
};
vector<node> ve[2005];

int cmp( node p, node q )
{
    return ( strcmp(p.ch, q.ch)<0 );
}

int main()
{
    char ch[20];
    int n, m, i, j;
    int x, y;
    scanf ( "%d %d", &n, &m );
    for ( i = 0;i < n; i++ )
    {
        scanf ( "%s %d", ch, &x );
        for ( j = 0;j < x; j++ )
        {
            scanf ( "%d", &y );
            node temp;
            strcpy(temp.ch, ch);
            ve[y].push_back(temp);
        }
    }
    for ( i = 1;i <= m; i++ )
    {
        printf ( "%d %d\n", i, ve[i].size() );
        sort( ve[i].begin(), ve[i].end(), cmp );
        for ( j = 0;j < ve[i].size(); j++ )
            printf ( "%s\n", ve[i][j].ch );
    }
    return 0;
}

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

char ss[2005][3505][20];
int num[2005];
int cmp( const void *a, const void *b )
{
    return ( strcmp((char*)a, (char*)b) );
}

int main()
{
    char ch[20];
    int n, m, i, j;
    int x, y;
    scanf ( "%d %d", &n, &m );
    for ( i = 0;i < n; i++ )
    {
        scanf ( "%s %d", ch, &x );
        for ( j = 0;j < x; j++ )
        {
            scanf ( "%d", &y );
            strcpy(ss[y][num[y]++], ch);
        }
    }
    for ( i = 1;i <= m; i++ )
    {
        printf ( "%d %d\n", i, num[i] );
        qsort( ss[i], num[i], sizeof(ss[i][0]), cmp );
        for ( j = 0;j < num[i]; j++ )
            printf ( "%s\n", ss[i][j] );
    }
    return 0;
}

代码菜鸟，如有错误，请多包涵！！！

如有帮助记得支持我一下，谢谢！！！