diff --git a/bucketsort.cpp b/bucketsort.cpp
new file mode 100644
index 0000000000000000000000000000000000000000..040866d22da50b63d2b95666e14876d585d6eac2
--- /dev/null
+++ b/bucketsort.cpp
@@ -0,0 +1,156 @@
+#include "mpi.h"
+#include <iostream>
+#include <fstream>
+#include <string>
+#include <iomanip>
+#include <cstdlib>
+#include <ctime>
+#include <algorithm>
+#include <assert.h>
+using namespace std;
+int main( int argc, char* argv[] )
+{
+ double starttime, endtime;
+ int proceso_id;
+ char processor_name[MPI_MAX_PROCESSOR_NAME];
+ int namelen;
+ int numprocsused;
+ // Intiating parallel part
+ MPI_Status stat;
+ MPI::Init();
+
+ MPI_Comm_size(MPI_COMM_WORLD, &numprocsused);
+ proceso_id = MPI::COMM_WORLD.Get_rank();
+ MPI_Get_processor_name(processor_name, &namelen);
+ unsigned int receivedElement;
+ if(proceso_id == 0) {
+ // if it is main process
+
+ // --- We are getting info from text file
+ int SIZE;
+ unsigned int value;
+ ifstream fd("testing_info.txt");
+ fd >> SIZE; // the first number on the first line is the number of numbers in file
+ unsigned int *array = new unsigned int [SIZE];
+ for(int c = 0 ; c < SIZE ; c++) {
+ fd >> value;
+ array[c] = value;
+ }
+ // --- DEBUG: in order to check if information was read properly
+ //for(int c = 0; c < SIZE; c++) {
+ // printf(" %d ", array1);
+ // if((c+1)%5 == 0 )
+ // printf("\n",SIZE);
+ //}
+
+ // starting time calculation of the sort
+ starttime = MPI_Wtime();
+
+ // min and max values are got
+ unsigned int min = array[0];
+ unsigned int max = array[0];
+ for(int i=0; i < SIZE; i++) {
+ if(array[i] < min) { min = array[i]; }
+ if(array[i] > max) { max = array[i]; }
+ }
+
+ // calculating how many numbers each bucket/process will get numbers
+ int *elementQtyArray = new int[numprocsused];
+ // default values
+ for(int d=1; d < numprocsused; d++) {
+ elementQtyArray[d] = 0;
+ }
+ for(int d=0; d < SIZE; d++) {
+ int increaseOf = max/(numprocsused-1);
+ int iteration = 1;
+ bool pridetas = false;
+ for(unsigned int j = increaseOf; j <= max; j = j + increaseOf) {
+ if(array[d] <= j) {
+ elementQtyArray[iteration]++;
+ pridetas = true;
+ break;
+ }
+ iteration++;
+ }
+ if (!pridetas) {
+ elementQtyArray[iteration-1]++;
+ }
+ }
+
+ // Sending how many each process/bucket will get numbers
+ for(int i=1; i<numprocsused; i++) {
+ MPI_Send(&elementQtyArray[i], 1, MPI_INT, i, -2, MPI_COMM_WORLD);
+ }
+
+ // doing the same, this time sending the numbers
+ for(int d=0; d < SIZE; d++) {
+ int increaseOf = max/(numprocsused-1);
+ int iteration = 1;
+ bool issiunte = false;
+ for (unsigned int j = increaseOf; j <= max; j = j + increaseOf) {
+ if(array[d] <= j) {
+ MPI_Send(&array[d], 1, MPI_UNSIGNED, iteration, -4, MPI_COMM_WORLD);
+ issiunte = true;
+ break;
+ }
+ iteration++;
+ }
+ if (!issiunte) {
+ MPI_Send(&array[d], 1, MPI_UNSIGNED, iteration-1, -4, MPI_COMM_WORLD);
+ }
+ }
+
+ // Getting back results and adding them to one array
+ int lastIndex = 0; int indexi = 0;
+ for(int i=1; i < numprocsused; i++) {
+ unsigned int * recvArray = new unsigned int [elementQtyArray[i]];
+ MPI_Recv(&recvArray[0], elementQtyArray[i], MPI_UNSIGNED, i, 1000, MPI_COMM_WORLD, &stat);
+ if(lastIndex == 0) {
+ lastIndex = elementQtyArray[i];
+ }
+ for(int j=0; j<elementQtyArray[i]; j++) {
+ array[indexi] = recvArray[j];
+ indexi++;
+ }
+ }
+
+ // stoping the time
+ endtime = MPI_Wtime();
+
+ // showing results in file
+ ofstream fr("results.txt");
+ for(int c = 0 ; c < SIZE ; c++) {
+ fr << array[c] << endl;
+ }
+ fr.close();
+
+ // sorting results
+ printf("it took %f seconds \n", endtime-starttime);
+ printf("Numbers: %d \n", SIZE);
+ printf("Processes: %d \n", numprocsused);
+//----------------------------------------------------------------------------------------------------------------
+ } else {
+ // if child process
+ int elementQtyUsed; // kiek elementu si gija gauja is tevinio proceso
+ // --- getting the number of numbers in the bucket
+ MPI_Recv(&elementQtyUsed, 1, MPI_INT, 0, -2, MPI_COMM_WORLD, &stat);
+
+ unsigned int *localArray = new unsigned int [elementQtyUsed]; // initiating a local bucket
+
+ // --- getting numbers from the main process
+ for(int li = 0; li < elementQtyUsed; li++) {
+ MPI_Recv(&receivedElement, 1, MPI_UNSIGNED, 0, -4, MPI_COMM_WORLD, &stat);
+ localArray[li] = receivedElement;
+ }
+
+ // --- sorting the bucket
+ sort(localArray, localArray+elementQtyUsed);
+
+ // --- sending back sorted array
+ MPI_Send(localArray, elementQtyUsed, MPI_UNSIGNED, 0, 1000, MPI_COMM_WORLD);
+ }
+
+ MPI::Finalize();
+
+ return 0;
+}
diff --git a/file.cpp b/file.cpp
index ba78dfe7e1bb03d9a50ddcf280f7a0832d4eadb9..f3de43f71ce8773f79b0c1a4ec4f9bb6efb2394e 100644
--- a/file.cpp
+++ b/file.cpp
@@ -8,7 +8,7 @@ using namespace std;
int main(int argc, char* argv[])
{
int size;
- cout << "Kokio dydzio masyva sugeneruot?" << endl; cin >> size;
+ cout << "Banyak isi array?" << endl; cin >> size;
unsigned int *array = new unsigned int [size];
unsigned int c;
srand(time(nullptr)); // preparing random function