Can I see another sample of this program? I'm having difficulty in understanding it [closed]

Question

Closed. This question needs to be more focused. It is not currently accepting answers.

---

Want to improve this question? Update the question so it focuses on one problem only by editing this post.

Closed 8 years ago.

Improve this question

int j = 0;              
while (j < A.length) {          
    i = j + 1;               
    while (i < A.length) {      
        if(A[i] < A[j])         
            //swap              
            int temp = A[i];        
            A[i] = A[j];
            A[j] = temp;            
        }                   
        i++;                
    }                   
    j++;        

}

a program that will output the number of swaps that will be executed for different array lengths as enumerated below: a. 100 b. 1,000 c. 10,000 d. 100,000 e. 1,000,000

Answer 1

initiate counter (j)
 while j is less than length(A) -
   /* if this pair is out of order */
   if A[index-1] > A[index] then
     /* swap them and remember something changed */
     swap( A[index-1], A[index] )
     swapped = true
   end if
 end while
increment counter (j)

p.s your brackets are not matching are you missing a code segment?

Answer 2

If I understand what you're asking then it is important to note that line indentation is not semantically meaningful in Java (you need braces),

if(A[i] < A[j]) { // <-- Open brace         
  //swap              
  int temp = A[i];        
  A[i] = A[j];
  A[j] = temp;   
} // <-- Close brace