Selection Sort Algorithm

#include<conio.h>#include<iostream.h>#include<stdio.h>class List{public: // Array of integers to hold values int arr[20]; // Number of elements in array int n; // Function to accept array elements void read() { while (1) { cout<<"\nEnter the number of elements in the array: "; cin>>n; if (n <= 20) break; else cout << "\nArray can have maximum 20 elements\n"; } //Display the header cout<<"\n"; cout<< "-----------------------\n"; cout<< "Enter array elements...

Read More

Merge Sort Algorithm

#include <iostream.h>#include <stdio.h>#include<conio.h>class List{    public:        int arr[20];         int sorted[20];        int cmp_count; //Number of comparisons        int mov_count; //Number of data movements        // Number of elements in array        int n;         List()        {            cmp_count = 0;   ...

Read More

Linear Search algorithm

#include <iostream.h>#include<conio.h>void main(){    clrscr();    int arr[20];    //Array to be searched    int n;      //Number of elements in the array     int i;    // Get the number of elements to store in the array    while (1)    { cout << "Enter the number of elements in the array(1-20): "; cin >> n; if ((n>0) && (n <= 20))    break; else    cout << "\nArray should have minimum...

Read More

Insertion sort algorithm

#include<iostream.h>#include<conio.h>void main(){ clrscr(); int a[100],i,n,p,ptr,temp; cout<<"\n------------ INSERTION SORT ------------ \n\n"; cout<<"Enter No. of Elements : "; cin>>n; cout<<"\nEnter Elements : \n"; for(i=1;i<=n;i++) { cin>>a[i]; } a[0]=0; for(p=2;p<=n;p++) { temp=a[p]; ptr=p-1; while(temp<a[ptr]) { a[ptr+1]=a[ptr];                // Move Element Forward ptr--; } a[ptr+1]=temp;          ...

Read More

Quick sort algorithm

#include <iostream.h>#include <stdio.h>#include<conio.h>class List{        public:        int arr[20];    //Array of integers to hold values         int cmp_count; //Number of comparisons int mov_count; //Number of data movements            int n; // Number of elements in the array         List()        {            cmp_count = 0;    mov_count...

Read More

Program on Bubble sort algo

#include<iostream.h>#include<stdio.h>#include<conio.h>class List{public:   // Array of integers to hold values int arr[20]; // Number of elements in array int n; // Function to accept array elements void read() { while (1) { cout<<"\nEnter the number of elements in the array: "; cin>>n; if (n <= 20) break; else cout << "\nArray can have maximum 20 elements\n"; } //Display the header cout<<"\n"; cout<< "-----------------------\n"; cout<< "Enter...

Read More

Program on binary selection>>>

#include<iostream.h>#include<conio.h>void main(){    clrscr();    int arr[20];    //Array to be searched    int n;      //Number of elements in the array     int i;    // Get the number of elements to store in the array    while (1)    { cout << "Enter the number of elements in the array: "; cin >> n; if ((n>0) && (n <= 20))    break; else    cout << "\nArray should have minimum 1...

Read More

System Analysis & Designing FAQ

System Analysis & Designing Frequently asked questions Q.1 What is a system? Ans:- The term system is grieved from the Greek work systema, which means an organized relationship among functioning units or components. Q.2 Explain phases of system development life cycle? Ans:- Following arr the phases of system development life cycle :- Recognition of need.  Feasibility study. Analysis. Design. Implementation. Post-implementation Maintenance. Q.3 Name the different types of system? Ans:- Following are the different types of system:-  Physical...

Read More