Thread: DATA STRECTURES - SORTING - BUBBLE-INSERTION-SELECTION SORT IN JAVA

Problem 2. Design a program that allows you to experiment
with different sort algorithms. This program should allow
you to easily plug-in new sort algorithms and compare them.
Assume that input data is generated randomly and stored in
a text file (have no less than 2000 items to sort). Do not
restrict your program to only one data type, or to one
ordering relationship. The data type, ordering relationship,
and the sorting method must be input parameters for your
program. It must produce a comparison chart of all implemented
sort algorithms (consider both comparisons and exchanges).
Do not forget to include worst and best cases in your
empirical study. Start with insertion, selection and
bubble sorts (other sorts will be included later as we
review/study them in class).

Submit a design sheet presenting the overall structure of
your program, pseudo-code descriptions of implemented
sort algorithms, extended explanation of all of the results
that your program generates, the code, and all outputs.

Originally Posted by Norm

Do you have any specific java programming questions?

Be sure to wrap all posted code in code tags.

I am looking for java program for bubble sort with 2000 integers from text file.

Bubble Sorting Algorithm:
the first two elements are compared, if the previous element is larger than the latter element, the position is swapped. Repeat this process, until sorting is completed.

example : en.verejava.com/?id=2024633747893

Insertion sort is a simple sorting algorithm suited for small data sets. During each iteration, the algorithm

Removes an element from an array
Compares it against the largest value in the array
Moves the element to its correct location.

Selective Sorting:

Select the smallest unsorted element remaining in the array and insert it after it has been sorted

Bubble sort is considered as simplest sorting algorithm for the fact that given array is traversed from first to last element. And while traversing, current element is compared with adjacent element and if current element is greater than the adjacent element, it is swapped.

Insertion sort sorts elements the way in which we sort playing cards. This sort can be fast when used with smaller arrays.

In selection sort algorithm smallest element in unsorted array is shifted to its correct position in an array. The number of times sorting takes place will always be one less than the number of integer elements in an array.

For java programs and examples on bubble, insertion and selection sort in java refer below resource
https://www.flowerbrackets.com/bubble-sort-java/
https://www.flowerbrackets.com/insertion-sort-java/
https://www.flowerbrackets.com/selection-sort-java/