Skip to Main Content
Programming and Data Structures
book

Programming and Data Structures

by Ashok Kamthane
August 2009
Intermediate to advanced content levelIntermediate to advanced
604 pages
21h 39m
English
Pearson India
Content preview from Programming and Data Structures
478 Programming and Data Structures
num[k] anum [h];
num[h] «txnp;
}
k++;
}
print£ ("\n Sorted array : ");
for (k«0;k<8;++k)
printf (" %d ",num[k]);
OUTPUT:
Enter Numbers: 45879321
Sorted array: 12345789
Explanation In the above program eight numbers are entered. The while loops and for loop are
used to access the elements, compare and exchange the elements. Every element of an array is
compared with all successive elements. When a small element is found it is stored at the beginning
location in the array using tmp variable.
Time complexity: Time complexity of bubble sort is 0 (n 2). This is because in each pass the elements
that
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Learning Data Structures and Algorithms

Learning Data Structures and Algorithms

Rod Stephens
Data Structures and Algorithms in C++, Second Edition

Data Structures and Algorithms in C++, Second Edition

Michael T. Goodrich, Roberto Tamassia, David M. Mount

Publisher Resources

ISBN: 9789332506343