Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Q. Write an algorithm INSERT which takes a pointer to a sorted list and a pointer to a node and inserts the node into its correct position or place in the list.
Ans:
/* structure containing the data part and link part */
struct node
{
int data ;
struct node *link ;
} ;
/* Following the inserts node to an ascending order linked list
*/
void INSERT ( struct node **q, int num )
struct node *r, *temp = *q ;
r = malloc ( sizeof ( struct node ) ) ;
r -> data = num ;
/* if list is empty or if new node is to be inserted before the first node */
if ( *q == NULL || ( *q ) -> data > num )
*q = r ;
( *q ) -> link = temp ;
}
else
/* traverse the entire linked list to search or found the position to insert the
new node */
while ( temp != NULL )
if ( temp -> data <= num && ( temp -> link -> data > num ||
temp -> link == NULL ))
r -> link = temp -> link ;
temp -> link = r ;
return ;
temp = temp -> link ; /* go to the next node */ }
A common person's faith is that a computer can do anything. It is far from truth. In realism computer can carry out only definite predefined instructions. The formal illustration o
what is boot algorithm and some example
Multilist Representation of graph
A graph G might be defined as a finite set V of vertices & a set E of edges (pair of connected vertices). The notation utilized is as follows: Graph G = (V, E) Consider the g
Approximating smooth surfaces with Polygon nets Networks of polygons are used to represent smooth surfaces. They are, of course, only an approximation to the true surface, but
Explain class P problems Class P is a class of decision problems that can be solved in polynomial time by(deterministic) algorithms. This class of problems is kno
a. In worst case the order of linear search is O (n/2) b. Linear search is more competent than Binary search. c. For Binary search, the array must be sorted in ascending orde
Program: Creation of a Circular linked list ALGORITHM (Insertion of an element into a Circular Linked List) Step 1 Begin Step 2 if the list is empty or new
conversion of centrigral to frahenhit
Define Minimum Spanning Tree A minimum spanning tree of a weighted linked graph is its spanning tree of the smallest weight, where the weight of a tree is explained as the sum
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd