Changed main c #322
Closed
Changed main c #322
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Added some header files and changed the min() function
Sudoju Solver using Recursion
Sudoku Solver
Update README.md
Ways to dispense currency by ATM machine involving recursion.
fixed and improved Prime.c
Create demonetization.c
improved the code
Create sudokusolver.c
Uses third-party library
Replaced ambigous return codes with macros.
Refactored the code
Formulate codes in Sort
Consistent naming of sorting algorithms in README file
Update LinearSearch.c
Added NULL check.
Create linears.c
Create binarys.c
Update binary_to_decimal.c
…o computer_oriented_statistical_methods/Simpson's_1-3rd_rule.c
Update Simpson's_1-3rd_rule.c
Prime factoriziation
changed README and corrected comments -- Prime Factoriziation
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
#include<stdio.h>
void main(){
int n,a[50],i,j,temp;
printf("enter limit:");
scanf("%d",&n);
printf("enter elements:\n");
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){
for(j=0;j<n-i-1;j++){
if(a[j]>a[j+1]){
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
}