Histogram Based, Real Time Lossless Data Compression Algorithm λ∈[(ArgMax⇔>∀xω1) (6. sayfa)

int main()
{
   char buf[50],str[30];
   FILE *fp = fopen("psps.txt", "r");
   if(!fp) return 0;
   fgets(buf,sizeof(buf),fp);
   __int64 i64 = _atoi64(buf);
   int slen = strlen(buf) + 1;
   while(fgets(buf,sizeof(buf),fp) != NULL)
   {
      __int64 i64_2 = _atoi64(buf);
      sprintf(str, "%I64d", i64_2 - i64);
      slen += strlen(str) +1; //+1 return karakteri
      i64 = i64_2;
   }
   int flen = ftell(fp);
   fclose(fp);

   float toplambayt = (slen * 4) / 8; //toplam karakter sayisini 4 bite carp 8 bite bol (return karakteri dahil)
   printf("kazanc orani: %% %.2f\ntoplambayt: %d\n", (float)100.0 - (toplambayt * 100 / flen), (int)toplambayt);
   getchar();
   return 0;
}

int main(int argc, char *argv[]) 
 {                         
    FILE *fp = fopen("dosya.tmp", "wb"); 
    if(!fp) return 0; 
    char *buf = (char*)malloc(65536); 
    for(int i=0;i<16;++i) 
    { 
       unsigned r = rand() * time(0); 
       srand(r); 
       Sleep((rand() * r) % 100); 
       for(int k=0;k<65536;++k) 
       { 
          buf[k] = rand() % 256; 
       } 
       fwrite(buf,1,65536,fp); 
    } 
    free(buf); 
    fclose(fp); 
 } 

#include <iostream>

void printReverseSquare(int nums[], int max) {
    if (max >= 0) {
        std::cout << nums[max] * nums[max] << " ";
        printReverseSquare(nums, max - 1);
    }
}

int main() {
    int arr[5] = {1, 2, 3, 4, 5};
    printReverseSquare(arr, 4);
    return 0;
}

 
 #include <iostream>  
 #include <list> 
 #include <algorithm> 
 using namespace std; 
 int main(int argc, char* argv[]) {  
   list<int> liste = {1,2,3,4,5};  
   for_each(liste.begin(), liste.end(), [](int &n){n = n*n; }); // elemanın karesini al ve eşitle (&n)  
   liste.reverse(); //  
   for (list<int>::const_iterator i=liste.begin(); i != liste.end(); ++i) cout << *i << ' ';} // sonucu bas