• Skip to primary navigation
  • Skip to main content
  • Skip to primary sidebar
  • Sql
  • php
  • C program
  • Seo

Codelack.com

  • Home
  • C++
  • networking
  • Sql server
    • what is rdbms | one to one | one to many | many to many relation-codlack
    • sql server create table
    • code rules in sql server
  • ASP.NET
    • control state in asp.net
    • cookie in asp.net
    • datalist control in asp .net
    • Using ASP.NET To Send Email
    • application state in asp.net
    • file upload control in asp.net
  • contact us
  • Data structure
    • what is Data structure
    • doubly linked list program in c
    • Array in data structure
    • circular queue in data structure
    • Linear data structure
    • Delete node at any position in singly linked list
    • dequeue in data structure
    • implementation of stack using a Linked list in data structure
    • implementation of stack using array in data structure
    • linked list algorithm
    • linked list in data structure
  • C
    • continue and break in c
    • history of c programming language
    • array program in c
    • c programming practice questions
    • enumeration in c
    • C programs with solutions
    • Characteristic of c
    • print 1 to 100 without using loop in c program
    • two single dimension 2D array in c
  • php
    • php
    • Variables in PHP
    • Scalar data types in php
    • Output function in php
    • how to use php string functions | example of string function
    • point to point configuration
    • error in php
    • Array in  php

sorting in data structure

 

Num[i] = num[loc];

Num[loc]= temp;

}

}

}

 

SELECTION SORT (Program)

/*selection sort*/

#include<stdio.h>

#include<conio.h>

Void main()

{

Int num[6],int i,j,loc,min,temp;

/*Accept numbers in the array */

Clrscr();

Printf(“enter the numbers …\n\n”);

For(i = 0; i <6; i++ )

{

Scanf(“%d”, &num[i]);

}

/*sort the number*/

For (i= 0; i=<5; i++)

{

Min =num[i];

Loc = I;

For(j=i+1; j<=5; j++)

{

If(num[j]<min)

{ min = num[j];

Loc = j;

}

}

If(loc! = i)

{

Temp = num[i];

Num[i] = num[loc];

Num[loc] = temp;

}

}

/*display the sorted numbers from  the array */

Printf (“\n the sorted numbers are  : \n\n”);

For(i=0;i<6;i++)

{

Prontf(“%d\n”,num[i]);

}

Getch();

}

 

 

Insertion sort (Algorithm)

 

GIVEN  : An array NUM of N elements

Objective : arrange the elements in ascending  order

INSERTION _SORT(NUM, N)

Where

NUM : THE ARRAY OF ELEMENTS

N      : The number of elements

STEP1 : REPEAT STEP2 THRU STEP3 FOR I = 0,1,2,….N-1

STEP2 :Store the current element

TEMP = NUM [i]

J = i+1

STEP3 : Compare all the elements in the  sublist

WHILE TEMP<NUM[J] AND  J>=0

DO

NUM[J+1] = NUM [J]

J = J-1

DONE

NUM [J+1] = TEMP

STEP4 END

INSERTION SORT(FUNCTION)

VOID insertion_sort(int num [], int n)

{

Int I, temp;

For(I = 0; i<6; i++)

{

Temp = num[i];

J = i-1;

While(temp<num[j]&& j>=0)

{

Num[j+1] = num[j];

J = j-1;

}

Num[j+1] = temp;

}

}

Primary Sidebar

sql

  • introduction of sql
  • database management system
  • hierarchical database management system
  • what is rdbms | one to one | one to many | many to many relation-codlack
  • codd rules in sql server
  • Character Data Type
  • constraint unique
  • sql server create table

Ads

data structure

  • Data structure
  • Linear data structure
  • Array in data structure
  • What is a algorithm
  • stacks in data structure
  • queue data structure
  • dequeue in data structure
  • Priority queue
  • circular queue in data structure
  • linked list algorithm
  • Delete node in singly linked list
  • tree in data structure
  • implementation of stack using array in data structure
  • implementation of stack using a Linked list in data structure
  • Doubly Linked List Implementation

C programming

  • history of c programming language
  • C programs with solutions
  • Characteristic
  • constraint unique
  • continue and break
  • doubly linked list program in c
  • dynamic memory allocation
  • enumeration
  • print 1 to 100 without using loop
  • Variable declaration

c++

  • Introduction to C++ | similarities of  C++ structure and  class
  • default argument in c++
  • access specifiers in c++
  • Function In C++
  • friend function in c++
  • constructor in c++
  • destructor in c++ | How to call destructor C++
  • exception handling in c++

Categories

array multiplication (1) asp.net (10) B.ed (1) C# (1) c# (1) C++ (2) C program (3) FormView control (1) php (2) Seo (5) Sql (1) Uncategorized (12)
disclaimer

Copyright © 2022 · codelack.com