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. Show the various passes of bubble sort on the unsorted given list 11, 15, 2, 13, 6
Ans:
The given data is as follows:-
Pass 1:-
11 15 2 13 6
11 2 15 13 6
11 2 13 15 6
11 2 13 6 [15]
Pass 2:-
11 2 13 6 15
2 11 13 6 15
2 11 6 [13 15]
Pass 3:-
2 11 6 13 15
2 6 [11 13 15]
Pass 4:-
2 6 11 13 15
2 [6 11 13 15]
Therefore, the sorted array becomes:-
important points on asymptotic notation to remember
Q. What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster than an algorithm whose running time is 2n on the same machine. A n
Ask consider the file name cars.text each line in the file contains information about a car ( year,company,manufacture,model name,type) 1-read the file 2-add each car which is repr
Construct a B+ tree for the following keys, starting with an empty tree. Each node in the tree can hold a maximum of 2 entries (i.e., order d = 1). Start with an empty root nod
The class Element represents a single node that can be part of multiple elements on a hotplate and runs in its own thread. The constructor accepts the initial temperature and a hea
Write an algorithm for searching a key from a sorted list using binary search technique 1. if (low > high) 2. return (-1) 3. mid = (low +high)/2; 4 .if ( X
The smallest element of an array's index is called its Lower bound.
A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is called as a Queue.
Representation of Linked list in Memory:- Each node has an info part and a pointer to the next node also known as link. The number of pointers is two in case of doubly linked
What is the best-case number of comparisons performed by mergesort on an input sequence of 2 k distinct numbers?
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