backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-15 03:10:07 +08:00
Code Issues Projects Releases Wiki Activity

formatting source-code for 153fb7b8a5

Browse Source
This commit is contained in:
github-actions
2020-05-30 04:02:09 +00:00
parent 92fe9495ec
commit 8a2de9842b
175 changed files with 1671 additions and 3460 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
sorting/bead_sort.cpp
View File

@@ -5,8 +5,7 @@
#define BEAD(i, j) beads[i * max + j]
// function to perform the above algorithm
void beadSort(int *a, int len)
{
void beadSort(int *a, int len) {
// Find the maximum element
int max = a[0];
for (int i = 1; i < len; i++)
@@ -21,12 +20,10 @@ void beadSort(int *a, int len)
for (int i = 0; i < len; i++)
for (int j = 0; j < a[i]; j++) BEAD(i, j) = 1;
for (int j = 0; j < max; j++)
{
for (int j = 0; j < max; j++) {
// count how many beads are on each post
int sum = 0;
for (int i = 0; i < len; i++)
{
for (int i = 0; i < len; i++) {
sum += BEAD(i, j);
BEAD(i, j) = 0;
}
@@ -36,11 +33,9 @@ void beadSort(int *a, int len)
}
// Put sorted values in array using beads
for (int i = 0; i < len; i++)
{
for (int i = 0; i < len; i++) {
int j;
for (j = 0; j < max && BEAD(i, j); j++)
{
for (j = 0; j < max && BEAD(i, j); j++) {
}
a[i] = j;
@@ -49,8 +44,7 @@ void beadSort(int *a, int len)
}
// driver function to test the algorithm
int main()
{
int main() {
int a[] = {5, 3, 1, 7, 4, 1, 1, 20};
int len = sizeof(a) / sizeof(a[0]);