// generate b[] array like below but randomly.
// note that there are no repeats.  All numbers 0 to 4 show up once.
int b[5];
b[0] = 3;
b[1] = 4;
b[2] = 0;
b[3] = 1;
b[4] = 2;
 
int temp[5];
// code to deep copy a[] array into temp[] array.
 
// use b[] to populate a[]
for (int i = 0; i < 5; i++)
     a[i] = temp[b[i]];

for(int i = 0; i < ARRAY_SIZE; i++){
   int j = rand() % ARRAY_SIZE;
 
   if(i != j)
      swap(array[i], array[j]);
   }

song1[i]={string Title,string artist,int size}

struct song
{
     // struct details
};
 
// miscellaneous code
 
song song1[8];
// filling song1[] array;
 
int b[8];
// calculate b[] array with random numbers
 
song temp[8];
// deep copy song1[] array into temp[] array.  May not need
// entire array, but it's easier to use entire array and deep copy.
 
// assign song1[] array using b[] array and temp[] array as explained in
// prior post.  May need to deep copy, may not, depends
// on implementation.  Easier to implement, in my opinion, using
// deep copy and entire temp[] array, though possibly less efficient.