Noob Data Engineer

Bubble sort is the simplest Sorting algorithm available. It works by repeatedly swapping the adjacent or neighbor element if they are in the wrong order. Working Actually in first pass bubble sort sets the largest element to its position, in the second pass algorithm sets the second largest element this continues till the list or array is not finally sorted. Here is the example image. To work with the algorithm you first have to understand what is swapping and how it is done. What is Swapping ?? Swapping is the technique to interchange the content of the two variables, using another variable called temporary variable. For the program in C #include <stdio.h> void bubbleSort(int s[],int size){ int c,swap,d; for (c = 0 ; c < size - 1; c++) { for (d = 0 ; d < size - c - 1; d++) { if (s[d] > s[d+1]) /* For decreasing order use < */ { swap = s[d]; s[d] = s[d+1]; s[d+1] = swap...

Distributed system DS is the subject mandatory subject in the seventh semester of the final year of Computer Science in Dr. APJ Abdul Kalam Technical University. Lab practical Questions. Assignment 1 Assignment 2 Assignment 3 Assignment 4 For the completed Answer of these assignments are in the link given below. Answers Thanks for being here. Subscribe to this blog for more post like this.

Welcome to the second part of this Series of C language. In this series, we will start with the basic of C language. Previous post Environment Setup Text Editor Install any of the text editor available in the market, suggestion consist of the Sublime Text Editor, notepad++ etc. I have been using Sublime Text Editor. Compiler Install the compiler if you have not previously then check out this post. Installing C/C++ (GCC) compiler On Windows Basics of C Before starting anything lets take a look at the minimum code required to run a C program. Now we are going to do the Most famous ritual of the programming, Program of Hello World. #include <stdio.h> int main(int argc, char const *argv[]) { printf("Hello World!\n"); return 0; } save this program as the hello.c this will give output as like Comments in C comment is of two types in C. first // this is single line comment in c Second, /* this is multiline comment in c language */ Semicolons in C A semicolon terminates the ...

Welcome to this tutorial series Learning C language. In this tutorial series, we start very easily with C language and learn it's concept easily and efficiently. We will learn by doing not by just the learning things and forgetting and again learning and forgetting. So to strengthen our concept we will do some example each tutorial so it will help us to build some experience and make our concept stronger. Remember with the Practice and Hard Work you can achieve anything in this so keep practicing Guys. After the startup motivation now we will start with the introduction of the C language. Note: I will try to keep tutorial short and easy so that they won't bother you of being too lengthy. Soooo without wasting much time let's start the tutorial. History First, let's start with the introduction. C language is an Imperative Procedural programming language developed by the Dennis Ritchie in 1972 at bell laboratories of AT&T (American Telephone & Telegraph), locat...

Here is the Code to create linked list #include <stdio.h> #include <stdlib.h> struct Node{ int data; struct Node *next; }; typedef struct Node *node; node createNewNode(){ node temp; temp = (node)malloc(sizeof(struct Node)); // allocate memory equal memory as the size using malloc() temp->next = NULL;// make next point to NULL (suppose this as last node) return temp; } node addNode(node head, int value){ node tmp,p; tmp = createNewNode(); tmp->data = value; if(head == NULL){ head = tmp; } else{ p = head; while(p->next != NULL){ p = p->next; } p->next = tmp; } return head; } int main() { node head = NULL; head = addNode(head,2); head = addNode(head,3); head = addNode(head,5); head = addNode(head,8); node p; p = head; while(p != NULL){ printf("%d\n",p->data); p = p->next; } ret...