Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

实现了必选的排序 #171

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

实现了必选的排序 #171

wants to merge 2 commits into from

Conversation

Lyc-heng
Copy link
Contributor

@Lyc-heng Lyc-heng commented Jun 7, 2017

No description provided.

Copy link
Collaborator

@cucyoyo cucyoyo left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

需要修改简单选择排序算法和希尔排序的逻辑。

a->r[key] = temp;
(*mtime) += 3;
}
}
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

再次理解简单选择排序算法原理

dk = 6;
ShellInsert(&test, dk, &comparetimes, &movetimes);
InsertSort(&test, &comparetimes, &movetimes);
printf("����ϣ������������:\n");
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

希尔排序结果有问题

}
if (d != 0) {
printf("\n----[����%dԪ��ʱ�����˳�ͻ%d��]----\n", keyvalue, d);
}
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

建议将没有冲突的插入过程也输出方便查看。

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants