Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<stdlib.h>
- #include<time.h>
- void fillArrayRange(int arr[], int size, int from, int to);
- void printArr(int ar[], int size);
- void sortDescending(int ar[], int size);
- void swap(int arr[],int size, int i, int j);
- void printArr(int ar[], int size);
- void sortInRange(int ar[], int size, int start, int end);
- int main() {
- int size = 11,from=-5,to=5, start=1, end=8;
- int array[size];
- fillArrayRange(array,size,from,to);
- printArr(array,size);
- printf("============1 task============\n");
- sortDescending(array, size);
- printArr(array,size);
- printf("============2 task============\n");
- sortInRange(array, size, start, end);
- printArr(array,size);
- return 0;
- }
- void sortInRange(int ar[], int size, int start, int end){
- int i,j,min,minIndex;
- for(i=start;i<end;i++)
- {
- min = ar[i];
- minIndex = i;
- for(j=i+1;j<size;j++)
- {
- if(ar[j]<min)
- {
- min = ar[j];
- minIndex=j;
- }
- }
- if(i!=minIndex)
- {
- swap(ar,size,i,minIndex);
- }
- }
- }
- void sortDescending(int ar[], int size) {
- int i,j,max,maxIndex;
- for(i=0;i<size;i++) {
- max = ar[i];
- maxIndex = i;
- for(j=i+1;j<size;j++) {
- if(ar[j]>max) {
- max = ar[j];
- maxIndex=j;
- }
- }
- if(i!=maxIndex) {
- swap(ar,size,i,maxIndex);
- }
- }
- }
- void swap(int arr[],int size, int i, int j) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j]= temp;
- }
- void fillArrayRange(int arr[], int size, int from, int to) {
- srand(time(NULL));
- int i;
- for(i=0;i<size; i++) {
- arr[i] = from+rand()%(to+1-from);
- }
- }
- void printArr(int ar[], int size) {
- int i;
- for(i=0;i<size;i++)
- {
- printf("%d ",ar[i]);
- }
- printf("\n");
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement