Algorithms

Writing a Sorting Algorithm
Total points 4
1.
Question 1
Assignment overview
This assignment is an opportunity for you to develop an
 algorithm of your own and have someone else execute it to give you 
feedback on its correctness and specificity.

You will write an 
algorithm that sorts temperature data from least to greatest. To do 
this, you will work through the first four of the Seven Steps.

Introduction to the data
NOAA's National Centers for Environmental Information collects global 
climate data and aggregates this data to provide information on climate 
trends and variability. One product they offer is a monthly regional 
analysis. The following table gives "anomaly" data by continent for 
January 2017. "Anomaly" means the value is the temperature difference 
from the average temperature from years 1910–2000.

Continent

Anomaly (C)

North America

3.18

South America

1.36

Europe

-0.12

Africa

0.53

Asia

1.92

Oceania

0.98

Source: https://www.ncdc.noaa.gov/sotc/global-regions/201701

Assignment task
Your task is to develop an algorithm that would sort data such as these 
from least to greatest. Specifically, given an unsorted set of N decimal
 values, your algorithm should sort them to give an answer of the sorted
 data. For this set of N = 6, your algorithm should produce:

-0.12

0.53

0.98

1.36

1.92

3.18

Step 1: Work an example by hand

Take the list 
of values, and sort them by hand. Sort them the way that comes most 
naturally to you. Do not research sorting algorithms or try to figure 
out the most efficient method—that is not the point of this assignment.

Step 2: Write down exactly what you did

Think
 carefully about how you performed the sort by hand. What values did you
 compare? In what order? How did you know when you were done? Write down
 these steps exactly.

Step 3: Generalize

Look for patterns in the steps you wrote down for Step 2. If you 
repeated sets of steps, how could you count repetitions? If you swapped 
certain values under certain conditions, what were they? Are there 
variables you need to name in order to reuse? Write down your 
step-by-step generalized algorithm.

Step 4: Test your algorithm

Execute
 your algorithm for a different set of data, such as a subset of the 
given data, data you make up, or another month's climate data, such as 
February 2017: https://www.ncdc.noaa.gov/sotc/global-regions/201702 

Does your algorithm work for any N? Have you thought of corner cases it might need to handle, such as N = 0 or N = 1?

How to submit:

Enter your algorithm in the text box. You can work
 in another program and copy/paste into the box, or you can type your 
algorithm directly. 

Your algorithm should be written in clear English, not C code.


1 point
What do you think?
Your answer cannot be more than 10000 characters.

I am currently taking a exercise is the shaker sort algorithm.Instead of separating two for loops, I have included a for-j loop inside a for-i loop. Please check my code.

public static void shakerSort(int array[], int n) 
{
    boolean swapped = true;
    while (swapped) 
    {
         swapped = false;
         for (int i = 0; i < n - 1; i++) 
         {
             if (array[i] > array[i + 1]) 
             {
                    int temp = array[i];
                    array[i] = array[i + 1];
                    array[i + 1] = temp;
                    swapped = true;
             }
                
             if (i == n - 2) 
             {
                 if (!swappped)
                 {
                    break;
                 }
                 else
                 {
                     swapped = false;
                     for (int j = n - 1; j > 0; j--) 
                     {
                          if (array[j - 1] > array[j]) 
                          {
                               int temp = array[j];
                               array[j] = array[j - 1];
                               array[j - 1] = temp;
                               swapped = true;
                          }
                     }
                     if (!swapped) 
                     {
                       break;
                     }
                 }     
             }
        }
    }

Output:

   -5
   -3
    5 
    9 
   11 
   12
   15
   18 

I hope you can rate my code .Thank you very much 

public int sumSqrtCeil(int n, String[] edges){
        ...

        List<Set<Integer>> edgeSetList = "converted first edges element to set of Integer"

        // iterate rest of edges elements -A
        for(int i=1;i<edges.length;i++){

            Set<Integer> nodeDuo = "converted this edges element to set of Integer"

            boolean found = false;
            //search for nodeDuo in set elements of edgeSetList

            //iterate the nodeDuo 2 element set -B
            for(Integer e : nodeDuo){
                //iterate the edgeSetList containing a linked set collection -C
                for (Set<Integer> edgeSet : edgeSetList) {
                    found = edgeSet.contains(e);
                    if (found) {
                        break;
                    }
                }
                if(found) break;
            }

            if(!found){
    
                //if nodeDuo has no element common to any element of edgeSetList then add a new set

                indexOfEdgeSetList++;
                edgeSetList.add(nodeDuo);
            }
            else{
                //else add nodeDuo to the existing set element of edgeSetList in which any of nodeDuo elements were found.
                edgeSetList.get(indexOfEdgeSetList).addAll(nodeDuo);
            }
        }


        Set<Integer> linkedNodes =         //identify a set of all nodes which are linked to a different node(s)

        //Add 1 for each unit nodes (the nodes which are no linked to any other nodes) -D
        for(int i=1;i<=n;i++){
            if(!linkedNodes.contains(i)) output+=1;
        }

        // Add ceil of square root of 'node count' of each linked set in linked nodes set collection -E
        output += edgeSetList.stream().mapToInt(integers -> (int) Math.ceil(Math.sqrt(integers.size()))).sum();
        return output;
    }