yeah at least teach me how to get the invariant ??
Type: Posts; User: alloka
yeah at least teach me how to get the invariant ??
i asked specificly for the invarint , and just to let you know i searched for it all over the internet and didn't get quite a way for getting the invariant and it wasn't explained to me before so i...
and thankx for helping btw , i will not ask here again , i don't ask so others can keep info from me .
so is this forum supposed for helping people or telling others what to do ?? , i asked for something and someone come and tell me we will not answer your homework , and btw this isn't a homework .
i made this code but i'm stuck in :
the fundamental operation in the described algorithm? How many operations does it take?
What is the invariant of this sorting algorithm?
the code :
...
nvmmm i solved it thnkxxx :)
thnkxxx so muchh :) :) but this prints the biggest first i want the smallest , any help ??
i'm trying to sort this array in special method by :
- Counting the number of smaller elements to find the correct position i.
– If the element is in its correct position, move to the succeeding...
public class Ass {
int [] array ;
public static void swap(int [] x) {
for (int i = 0 ; i<x.length ; i++){
int b =0 ;
for (int j = 0 ; j<x.length ; j++){