What do you want to save?
Add Code snippet
New code examples
-
Other 2021-10-17 11:44:16
dequeue operations using static array
# include<stdio.h> # define MAX 5 int deque_arr[MAX]; int left = -1; int right = -1; /*Begin of insert_right*/ void insert_right() { int added_item; if((left == 0 && right == MAX-1) || (left == right+1)) { printf("Queue Overflow\n&... Add solution -
Other 2021-10-15 07:07:07
bfs traversal code
// BFS algorithm in C #include <stdio.h> #include <stdlib.h> #define SIZE 40 struct queue { int items[SIZE]; int front; int rear; }; struct queue* createQueue(); void enqueue(struct queue* q, int); int dequeue(struct queue* q); void d... Add solution -
C 2021-10-04 01:06:03
hill cipher encryption in c
#include<stdio.h> #include<math.h> float encrypt[3][1], decrypt[3][1], a[3][3], b[3][3], mes[3][1], c[3][3]; void encryption(); //encrypts the message void decryption(); //decrypts the message void getKeyMessage(); //gets key and message f... Add solution -
Python 2021-10-02 16:53:04
pascal's triangle python reverse function
#include <stdio.h> #include <stdlib.h> int main() { int N; scanf("%d", &N); int pascalArray[N + 1][N + 1]; int i, j; if(0 <= N && N <= 20) { for (i = 0; i < N + 1; i++) { for(j =... Add solution -
Other 2021-09-26 21:22:03
what is the need of memset funtion
#include <stdio.h> #include <string.h> #define LEN 10 int main(void) { char arr[LEN]; int loop; printf("Array elements are (before memset()): \n"); for(loop=0; loop<LEN; loop++) printf("%d ",arr[loop]); printf(&... Add solution -
C 2021-09-25 13:16:02
lru page replacement algorithm in c
/* This code is contributed by : Tanishq Vyas (github : https://github.com/tanishqvyas ) */ #include <stdlib.h> #include <stdio.h> int main(int argc, char const *argv[]) { int length; int num_frames; printf("Enter the ... Add solution
Best helpers
Daniel Cook
+5
Czlsws
+5
Shahruz Raad
+5
Horse
+5
Csandreas1
+5
SOUMEN
+5
Vy32
+5
Anugram
+5
ImMathan
+5
Joyo
+5
Huggy Buggy
+5