Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
61 changes: 29 additions & 32 deletions Sorting/Bogosort/C/bogosort.c
Original file line number Diff line number Diff line change
@@ -1,40 +1,37 @@
#include <stdio.h>
#include <stdlib.h>
#include <time.h>

int isSorted(int *v, int size)
#include <stdbool.h>
bool is_sorted(int *a, int n)
{
int i;
for (i = 0; i < size - 1; i++)
if (v[i] > v[i+1])
return 0;
return 1;
while ( --n >= 1 ) {
if ( a[n] < a[n-1] ) return false;
}
return true;
}

void bogoSort(int *v, int size)
void shuffle(int *a, int n)
{
int i, aux, r;
while (!isSorted(v, size))
{
for (i = 0; i < size; i++)
{
r = rand() % size;
aux = v[i];
v[i] = v[r];
v[r] = aux;
}
}
int i, t, r;
for(i=0; i < n; i++) {
t = a[i];
r = rand() % n;
a[i] = a[r];
a[r] = t;
}
}

int main()
void bogosort(int *a, int n)
{
srand(time(NULL));
int v[8] = {5, 8, 2, 1, 6, 4, 3, 7};

bogoSort(v, 8);
int i;
for (i = 0; i < 8; i++)
printf("%d ", v[i]);
printf("\n");
return 0;
while ( !is_sorted(a, n) ) shuffle(a, n);
}

int main()
{
int numbers[] = { 1, 10, 9, 7, 3, 0 };
int i;

bogosort(numbers, 6);
for (i=0; i < 6; i++) printf("%d ", numbers[i]);
printf("\n");
}
36 changes: 36 additions & 0 deletions Sorting/Insertion Sort/C/insertion_2_for.txt
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
\\insertion sorting using 2 for loops

#include<stdio.h>
int main()
{
int arr[100];
int i,j,a,n,temp;
printf("ENTER THE NUMBER OF ELEMENTS TO BE PRESENT IN ARRAY:\n");
scanf("%d",&n);
printf("ENTER THE ARRAY:\n");
for(a=0;a<n;a++)
{
scanf("%d",&arr[a]);
}
printf("YOUR ENTERED ARRAY IS:\n");
for(a=0;a<n;a++)
{
printf("%d";arr[a]);
}
for(i=1;i<n;i++)
{
temp=arr[i];
for(j=i-1;j>=0&&arr[j]>temp;j--)
{
arr[j+1]=arr[j];

}
arr[j+1]=temp;
}
printf("YOUR SORTED ARRAY IS:\n");
for(a=0;a<n;a++)
{
printf("%d",arr[a]);
}
return 0;
}