Convert CocktailSort algorithm from Java to C ++

Question

Convert CocktailSort algorithm from Java to C ++

Navigation

#1 by (1 votes)

0

public class CocktailSort {

    public static int izquierda, derecha, ultimo;
    public static int arreglo[] = {10, 23, 6, 4, 223, 2, 112, 3, 6, 34};

    public static void main(String[] args) {

        izquierda = 1;
        derecha = arreglo.length;
        ultimo = arreglo.length - 1;

        do {
            for (int i = arreglo.length - 1; i > 0; i--) {
                if (arreglo[i - 1] > arreglo[i]) {
                    int aux = arreglo[i];
                    arreglo[i] = arreglo[i - 1];
                    arreglo[i - 1] = aux;
                    ultimo = i;
                }
            }

            izquierda = ultimo + 1;

            for (int j = 1; j < arreglo.length; j++) {
                if (arreglo[j - 1] > arreglo[j]) {
                    int aux = arreglo[j];
                    arreglo[j] = arreglo[j - 1];
                    arreglo[j - 1] = aux;
                    ultimo = j;
                }
            }
            derecha = ultimo - 1;
        } while (derecha >= izquierda);

        for (int i = 0; i < arreglo.length; i++) {
            System.out.println(arreglo[i]);
        }
    }
}

java c++

asked by Tecprogramer 09.04.2017 в 07:10

source

1 answer

Replicate a table every time another one is updated method of. it does not work the way I thought

score 1 · Accepted Answer

This is the code in C ++. I am not a C ++ programmer, so I may have errors or bad practices:

#define LENGHT 10

#include <iostream>

using namespace std;

int izquierda, derecha, ultimo;
int arreglo[LENGHT] = { 10, 23, 6, 4, 223, 2, 112, 3, 6, 34 };

int main() {

    izquierda = 1;
    derecha = LENGHT;
    ultimo = LENGHT - 1;

    do {
        for (int i = LENGHT - 1; i > 0; i--) {
            if (arreglo[i - 1] > arreglo[i]) {
                int aux = arreglo[i];
                arreglo[i] = arreglo[i - 1];
                arreglo[i - 1] = aux;
                ultimo = i;
            }
        }

        izquierda = ultimo + 1;

        for (int j = 1; j < LENGHT; j++) {
            if (arreglo[j - 1] > arreglo[j]) {
                int aux = arreglo[j];
                arreglo[j] = arreglo[j - 1];
                arreglo[j - 1] = aux;
                ultimo = j;
            }
        }
        derecha = ultimo - 1;
    } while (derecha >= izquierda);

    for (int i = 0; i < LENGHT; i++) {
        cout << arreglo[i] << endl;
    }

    // pausa
    cin.get();
    return 0;
}