Tag Archives: recursion
Quick Sort using recursion
//Quick sorting using Recursion #include<stdio.h> #include<stdlib.h> //Prototypes of functions used int * input(int *,int); int * sort(int *,int); void display(int*,int); int main() { int *a,n; printf(“Enter number of numbers you want to sort?\n”); scanf(“%d”,&n); a = input(a,n); a = sort(a,n);//call … Continue reading
Posted in Data Structures with C
Tagged C++, Functions, quick sort, recursion, sorting
Leave a comment
Bubble sorting using recursion
#include<stdio.h> #include<stdlib.h> int * input(int *,int); int * sort(int *,int); void display(int*,int); int main() { int *a,n,i,j,c,temp; printf(“Enter number of numbers you want to sort?\n”); scanf(“%d”,&n); a = input(a,n); a = sort(a,n); display(a,n); } int * input(int *a,int n) { … Continue reading
Posted in Data Structures with C
Tagged buuble sort, C++, function, pointers, recursion
Leave a comment
