for (int i = 1; i < box_count; i++) {

        int box_morton = flat_tree->at(i)->morton_box();

        float adaptive_str_sum = 0.0f;
        float regular_str_sum = 0.0f;

        int mortoncount = boxes[box_morton-1].y - boxes[box_morton-1].x;
        int adaptivecount = flat_tree->at(i)->recv_end - flat_tree->at(i)->recv_start;

        for (int j = flat_tree->at(i)->recv_start; j < flat_tree->at(i)->recv_end; j++) {
            adaptive_str_sum += adaptive_sort_particles[j].particle.w;
        }

        for (int j = boxes[box_morton-1].x; j < boxes[box_morton-1].y; j++) {
            regular_str_sum += sort_particles[j].data.w;
        }

        if (mortoncount!=adaptivecount) {
            sorting_passed = false;
            break;
        }

        if (fabs(adaptive_str_sum-regular_str_sum) > 0.1) {
            sorting_passed = false;
            break;
        }

    }

    if (sorting_passed) printf("sorting passed, carrying on!\n"); else {printf("sorting failed, shutting down!\n"); exit(0);}