Hey what's up? We are a free website solely relying on advertisement revenue! Please support us by disabling your adBlock for this site and good things will happen!

Array Binary Sort

in C | 2018-06-15

Difficulty : Beginner

By DePaul Dimadis

Choose your prefered Language:

Write a program in C language that will introduce N integers in a one-dimensional N-Array (N = known) and will rank it in ascending order of its data.
An integer A is then inserted and:

if the number A is present in the array, its position will be located, with the least possible effort (binary search).
If the number is found more than one times, only the first encountered location will be displayed.
if the number A is not present in the array is inserted into it in the appropriate position so that the array will still be sorted.

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define N 100

int a[N],i,j,b,c,temp;
void main ()
{
	srand ((unsigned int)time(0));
	for(i=0;i<N;i++)
		{a[i]=rand()%1000;

	printf("%d\n",a[N]);}
	for(i=99;i>0;i--){
		for(j=0;j<i;j++)
			if(a[j]>a[j+1])
				{
					temp=a[j];
					a[j]=a[j+1];
					a[j+1]=temp;
				}
	}
	for(i=0;i<N;i++)
		printf("%d\n",a[i]);

	printf("input number\n");
	scanf("%d",&b);
	for(i=0;i<N;i++)
		if(b==a[i])
		{
			c=i;
			printf("%d\n",c);
		}
}//end of void

Want to Become a Better Coder?

$Programming in C (Developer\'s Library) 4th Edition$

A note from duthcode team.

Array Binary Sort

Want to Become a Better Coder?

Tags

Advertisement