Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
blue saver go my marshal green
//gcc 5.4.0 #include <stdio.h> int main(void) { printf("Hello, world!\n"); return 0; }https://play.google.com/store/apps/details?id=vrpatel0018.cprograms //Insertion sort #include<stdio.h> int main(){ int n, array[1000], c, d, t; printf("Enter number of elements\n"); scanf("%d", &n); printf("Enter %d integers\n", n); for (c = 0; c < n; c++) { scanf("%d", &array[c]); } for (c = 1 ; c <= n - 1; c++) { d = c; while ( d > 0 && array[d-1] > array[d]) { t = array[d]; array[d] = array[d-1]; array[d-1] = t; d--; } } printf("Sorted list in ascending order:\n"); for (c = 0; c <= n - 1; c++) { printf("%d\n", array[c]); } return 0 ; }
run
|
edit
|
history
|
help
0
to find a number is even or not
14th Feb Programming Project v.01
Midterm practice, turn into for loop
A_141117_Primo02
22nd HW Switchv0.24
B_141202_CTYPE
PRÁCTICA DE QUICKSORT
Project 3 Part 1 v1.4
18BCE2182 ASSESS_3 Q2
Lior Yehieli Lesson