gdata.io.handleScriptLoaded({"version":"1.0","encoding":"UTF-8","feed":{"xmlns":"http://www.w3.org/2005/Atom","xmlns$openSearch":"http://a9.com/-/spec/opensearchrss/1.0/","xmlns$gd":"http://schemas.google.com/g/2005","xmlns$georss":"http://www.georss.org/georss","xmlns$thr":"http://purl.org/syndication/thread/1.0","xmlns$blogger":"http://schemas.google.com/blogger/2008","id":{"$t":"tag:blogger.com,1999:blog-8285804830535272268"},"updated":{"$t":"2023-07-30T02:11:08.392-07:00"},"category":[{"term":"C Programs"},{"term":"Pointers"},{"term":"string"},{"term":"Array"},{"term":"Learn C"},{"term":"Fundamental"},{"term":"Pattern"},{"term":"control sturctures"},{"term":"searching and sorting"},{"term":"recursion"},{"term":"List of C Programs"},{"term":"Structures"},{"term":"C Turbo Compiler"},{"term":"File Handling"},{"term":"Contents"},{"term":"Common Programming Error"},{"term":"functions"},{"term":"Dynamic memory allcation"}],"title":{"type":"text","$t":"C Programming Tutorial"},"subtitle":{"type":"html","$t":"It is a blog about c programming. Here we provide c programs and tutorials to enhance your skills."},"link":[{"rel":"http://schemas.google.com/g/2005#feed","type":"application/atom+xml","href":"https://www.blogger.com/feeds/8285804830535272268/posts/default/-/Dynamic+memory+allcation?alt\u003djson-in-script\u0026max-results\u003d50"},{"rel":"self","type":"application/atom+xml","href":"https://www.blogger.com/feeds/8285804830535272268/posts/default/-/Dynamic+memory+allcation?alt\u003djson-in-script\u0026max-results\u003d50"},{"rel":"alternate","type":"text/html","href":"http://www.comp-psyche.com/search/label/Dynamic%20memory%20allcation"},{"rel":"hub","href":"http://pubsubhubbub.appspot.com/"}],"author":[{"name":{"$t":"Mantu Kumar"},"uri":{"$t":"https://www.blogger.com/profile/02897308282659594376"},"email":{"$t":"noreply@blogger.com"},"gd$image":{"rel":"http://schemas.google.com/g/2005#thumbnail","width":"35","height":"35","src":"//www.blogger.com/img/blogger_logo_round_35.png"}}],"generator":{"version":"7.00","uri":"https://www.blogger.com","$t":"Blogger"},"openSearch$totalResults":{"$t":"2"},"openSearch$startIndex":{"$t":"1"},"openSearch$itemsPerPage":{"$t":"50"},"entry":[{"id":{"$t":"tag:blogger.com,1999:blog-8285804830535272268.post-4467890176216028238"},"published":{"$t":"2014-01-29T07:55:00.000-08:00"},"updated":{"$t":"2014-04-16T01:02:14.560-07:00"},"category":[{"scheme":"http://www.blogger.com/atom/ns#","term":"C Programs"},{"scheme":"http://www.blogger.com/atom/ns#","term":"Dynamic memory allcation"}],"title":{"type":"text","$t":"C PROGRAMS : DYNAMIC MEMORY ALLOCATION"},"content":{"type":"html","$t":"\u003cdiv dir\u003d\"ltr\" style\u003d\"text-align: left;\" trbidi\u003d\"on\"\u003e\u003ctitle\u003eC PROGRAMS : DYNAMIC MEMORY ALLOCATION\u003c/title\u003e\u003cbr /\u003e\n\u003ca href\u003d\"http://www.comp-psyche.com/2014/01/c-programs-dma1.html#p5\" name\u003d\"p5\"\u003e5. Program to find the sum of \"n\" elements\u003c/a\u003e\u003cbr /\u003e\n\u003cdiv class\u003d\"mokcode\"\u003e\u003cpre\u003e\u003cspan style\u003d\"color: blue;\"\u003e#include\u0026lt;stdio.h\u0026gt;\n#include\u0026lt;conio.h\u0026gt; \u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e// Linux user - Remove this\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n#include\u0026lt;stdlib.h\u0026gt;\n\nint main()\n{\n    int *ptr,n,i, sum\u003d0;\n    \n    printf(\"Enter number of elements : \");\n    scanf(\"%d\",\u0026amp;n);\n    \n    // Allocating memory dynamically\n    ptr\u003d(int *)malloc(n*sizeof(int));\n    \n    // Inputing elements\n    printf(\"Enter Elements : \");\n    for(i\u003d0;i\u0026lt;n;i++)\n    {\n       scanf(\"%d\",(ptr+i));\n    }\n    \n    // Calculating sum\n   for(i\u003d0;i\u0026lt;n;i++)\n    {\n     sum \u003d sum + *(ptr+i);\n    }  \n    \n    // Displaying elements\n    printf(\"Entered elements : \");\n    for(i\u003d0;i\u0026lt;n;i++)\n    {\n    printf(\"%d \",*(ptr+i));\n    }\n \n    // Displaying sum\n    printf(\"\\nSum of elements : %d\",sum);\n\n    // Deallocating memory\n    free(ptr);\n \n    getch(); \u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e// Linux user - Remove this\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n    return 0;\n}\n\u003c/span\u003e\u003c/pre\u003e\u003c/div\u003e\u003cbr /\u003e\n\u003ca href\u003d\"http://www.comp-psyche.com/2014/01/c-programs-dma1.html#p6\" name\u003d\"p6\"\u003e6. Program to sort \"n\" elements in ascending order \u003c/a\u003e\u003cbr /\u003e\n\u003cdiv class\u003d\"mokcode\"\u003e\u003cpre\u003e\u003cspan style\u003d\"color: blue;\"\u003e#include\u0026lt;stdio.h\u0026gt;\n#include\u0026lt;conio.h\u0026gt; \u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e// Linux user - Remove this\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n#include\u0026lt;stdlib.h\u0026gt;\n\nint main()\n{\n    int *ptr,n,i,j, temp;\n    \n    printf(\"Enter number of elements : \");\n    scanf(\"%d\",\u0026amp;n);\n    \n    // Allocating memory dynamically\n    ptr\u003d(int *)malloc(n*sizeof(int));\n    \n    // Inputing elements\n    printf(\"Enter Elements : \");\n    for(i\u003d0;i\u0026lt;n;i++)\n    {\n       scanf(\"%d\",(ptr+i));\n    }\n    \n    // Displaying elements\n    printf(\"Entered elements : \");\n    for(i\u003d0;i\u0026lt;n;i++)\n    {\n       printf(\"%d \",*(ptr+i));\n    }\n \n    // Sorting elements\n   for(i\u003d0;i\u0026lt;n;i++)\n        {\n     for(j\u003di+1;j\u0026lt;n;j++)\n     {\n      if( *(ptr+i) \u0026gt; *(ptr+j) )\n      {\n       temp\u003d*(ptr+i);\n       *(ptr+i)\u003d*(ptr+j);\n       *(ptr+j)\u003dtemp;\n      }\n     }\n  }  \n    \n \n // Displaying sorted elements\n printf(\"\\nElements sorted in ascending order : \");\n for(i\u003d0;i\u0026lt;n;i++)\n        {\n        printf(\"%d \",*(ptr+i));\n }\n \n // Deallocating memory\n free(ptr);\n \n    getch(); \u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e// Linux user - Remove this\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n    return 0;\u003c/span\u003e\n}\n\u003c/pre\u003e\u003c/div\u003e\u003cbr /\u003e\n\u003ca href\u003d\"http://www.comp-psyche.com/2014/01/c-programs-dma1.html#p7\" name\u003d\"p7\"\u003e7.  Program to search an element \u003c/a\u003e\u003cbr /\u003e\n\u003cdiv class\u003d\"mokcode\"\u003e\u003cpre\u003e\u003cspan style\u003d\"color: blue;\"\u003e#include\u0026lt;stdio.h\u0026gt;\n#include\u0026lt;conio.h\u0026gt; \u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e// Linux user - Remove this\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n#include\u0026lt;stdlib.h\u0026gt;\n\nint main()\n{\n    int *ptr,n,i, sum\u003d0;\n    \n    //Declaring variable es\u003delement to be searched, flag\u003dindicates if element found or not\n    int es, flag\u003d0;\n    \n    printf(\"Enter number of elements : \");\n    scanf(\"%d\",\u0026amp;n);\n    \n    // Allocating memory dynamically\n    ptr\u003d(int *)malloc(n*sizeof(int));\n    \n    // Inputing elements\n    printf(\"Enter Elements : \");\n    for(i\u003d0;i\u0026lt;n;i++)\n    {\n    scanf(\"%d\",(ptr+i));\n }\n    \n    // Displaying elements\n    printf(\"Entered elements : \");\n    for(i\u003d0;i\u0026lt;n;i++)\n    {\n    printf(\"%d \",*(ptr+i));\n }\n \n    // Inputing element to be searched\n    printf(\"\\nEnter element to be searched : \");\n    scanf(\"%d\",\u0026amp;es);\n    \n    // Searching element\n   for(i\u003d0;i\u0026lt;n;i++)\n    {\n     if( *(ptr+i)\u003d\u003des)\n     {\n      flag\u003d1;\n      break;\n     }\n }  \n \n // Displaying element searched or not\n if(flag\u003d\u003d1)\n printf(\"Element found \");\n \n else\n printf(\"Element not found \");\n \n // Deallocating memory\n free(ptr);\n \n    getch(); \u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e// Linux user - Remove this\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n    return 0;\n}\u003c/span\u003e\n\u003c/pre\u003e\u003c/div\u003e\u003cbr /\u003e\n\u003ca href\u003d\"http://www.comp-psyche.com/2014/01/c-programs-dma1.html#p8\" name\u003d\"p8\"\u003e8. Program to enter three strings and sort them in ascending order alphabetically\u003c/a\u003e\u003cbr /\u003e\n\u003cdiv class\u003d\"mokcode\"\u003e\u003cpre\u003e\u003cspan style\u003d\"color: blue;\"\u003e#include\u0026lt;stdio.h\u0026gt;\n#include\u0026lt;conio.h\u0026gt; \u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e// Linux user - Remove this\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n#include\u0026lt;stdlib.h\u0026gt;\n#include\u0026lt;string.h\u0026gt;\nint main()\n{\n int i,j;\n \n // Declaring variable temp\u003dtempeorary helps in swapping strings\n char temp[50];\n \n // Here 3 \u003d number of string which we can enter\n char *p1[3];\n\n // Inputing string\n printf(\"Enter three strings : \");\n for(i\u003d0;i\u0026lt;3;i++)\n {\n  p1[i]\u003d(char *)malloc(12*sizeof(char));\n  gets(p1[i]);\n }\n \n // Performing sorting\n for(i\u003d0;i\u0026lt;3;i++)\n {\n  for(j\u003di+1;j\u0026lt;3;j++)\n  {\n   // swapping strings\n   if(strcmp(p1[i],p1[j])\u0026gt;0)\n   {\n    strcpy(temp,p1[i]);\n    strcpy(p1[i],p1[j]);\n    strcpy(p1[j],temp);\n   }\n  }\n }\n \n // Displaying sorted string\n printf(\"Sorted string : \\n\");\n for(i\u003d0;i\u0026lt;3;i++)\n puts(p1[i]);\n\n getch(); \u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e// Linux user - Remove this\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n return 0;\n}\n\u003c/span\u003e\u003c/pre\u003e\u003c/div\u003e\u003cbr /\u003e\n\u003c/div\u003e"},"link":[{"rel":"replies","type":"application/atom+xml","href":"https://www.comp-psyche.com/feeds/4467890176216028238/comments/default","title":"Post Comments"},{"rel":"replies","type":"text/html","href":"https://www.comp-psyche.com/2014/01/c-programs-dma1.html#comment-form","title":"0 Comments"},{"rel":"edit","type":"application/atom+xml","href":"https://www.blogger.com/feeds/8285804830535272268/posts/default/4467890176216028238"},{"rel":"self","type":"application/atom+xml","href":"https://www.blogger.com/feeds/8285804830535272268/posts/default/4467890176216028238"},{"rel":"alternate","type":"text/html","href":"https://www.comp-psyche.com/2014/01/c-programs-dma1.html","title":"C PROGRAMS : DYNAMIC MEMORY ALLOCATION"}],"author":[{"name":{"$t":"Mantu Kumar"},"uri":{"$t":"https://www.blogger.com/profile/02897308282659594376"},"email":{"$t":"noreply@blogger.com"},"gd$image":{"rel":"http://schemas.google.com/g/2005#thumbnail","width":"35","height":"35","src":"//www.blogger.com/img/blogger_logo_round_35.png"}}],"thr$total":{"$t":"0"}},{"id":{"$t":"tag:blogger.com,1999:blog-8285804830535272268.post-6914796806847001338"},"published":{"$t":"2014-01-29T07:45:00.000-08:00"},"updated":{"$t":"2014-04-16T01:02:28.080-07:00"},"category":[{"scheme":"http://www.blogger.com/atom/ns#","term":"C Programs"},{"scheme":"http://www.blogger.com/atom/ns#","term":"Dynamic memory allcation"}],"title":{"type":"text","$t":"C PROGRAMS : DYNAMIC MEMORY ALLOCATION"},"content":{"type":"html","$t":"\u003cdiv dir\u003d\"ltr\" style\u003d\"text-align: left;\" trbidi\u003d\"on\"\u003e\u003ctitle\u003eC PROGRAMS : DYNAMIC MEMORY ALLOCATION\u003c/title\u003e\u003cbr /\u003e\n\u003ca href\u003d\"http://www.comp-psyche.com/2014/01/c-programs-dma.html#p1\" name\u003d\"p1\"\u003e1. Program to dynamically allocate memory using calloc for \"n\" integer elements, input elements, display it and then free the memory\u003c/a\u003e\u003cbr /\u003e\n\u003cdiv class\u003d\"mokcode\"\u003e\u003cpre\u003e\u003cspan style\u003d\"color: blue;\"\u003e#include\u0026lt;stdio.h\u0026gt;\n#include\u0026lt;conio.h\u0026gt; \u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e// Linux user - Remove this\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n#include\u0026lt;stdlib.h\u0026gt;\n\nint main()\n{\n    int *ptr,n,i;\n    \n    printf(\"Enter number of elements : \");\n    scanf(\"%d\",\u0026amp;n);\n    \n    // Allocating memory dynamically\n    ptr\u003d(int *)calloc(n,sizeof(int));\n    \n    // Inputing elements\n    printf(\"Enter Elements : \");\n    for(i\u003d0;i\u0026lt;n;i++)\n    {\n    scanf(\"%d\",(ptr+i));\n }\n    \n    // Displaying elements\n    printf(\"Entered elements : \");\n    for(i\u003d0;i\u0026lt;n;i++)\n    {\n    printf(\"%d \",*(ptr+i));\n }\n \n // Deallocating memory\n free(ptr);\n \n    getch(); \u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e// Linux user - Remove this\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n    return 0;\n}\u003c/span\u003e\n\u003c/pre\u003e\u003c/div\u003e\u003cbr /\u003e\n\u003ca href\u003d\"http://www.comp-psyche.com/2014/01/c-programs-dma.html#p2\" name\u003d\"p2\"\u003e2. Program to dynamically allocate memory using malloc for \"n\" integer elements, input elements, display it and then free the memory\u003c/a\u003e\u003cbr /\u003e\n\u003cdiv class\u003d\"mokcode\"\u003e\u003cpre\u003e\u003cspan style\u003d\"color: blue;\"\u003e#include\u0026lt;stdio.h\u0026gt;\n#include\u0026lt;conio.h\u0026gt; \u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e// Linux user - Remove this\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n#include\u0026lt;stdlib.h\u0026gt;\n\nint main()\n{\n    int *ptr,n,i;\n    \n    printf(\"Enter number of elements : \");\n    scanf(\"%d\",\u0026amp;n);\n    \n    // Allocating memory dynamically\n    ptr\u003d(int *)malloc(n*sizeof(int));\n    \n    // Inputing elements\n    printf(\"Enter Elements : \");\n    for(i\u003d0;i\u0026lt;n;i++)\n    {\n    scanf(\"%d\",(ptr+i));\n }\n    \n    // Displaying elements\n    printf(\"Entered elements : \");\n    for(i\u003d0;i\u0026lt;n;i++)\n    {\n    printf(\"%d \",*(ptr+i));\n }\n \n // Deallocating memory\n free(ptr);\n \n    getch(); \u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e// Linux user - Remove this\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n    return 0;\n}\u003c/span\u003e\n\u003c/pre\u003e\u003c/div\u003e\u003cbr /\u003e\n\u003ca href\u003d\"http://www.comp-psyche.com/2014/01/c-programs-dma.html#p3\" name\u003d\"p3\"\u003e3. Program to dynamically allocate memory using malloc for \"n\" integer elements, input elements and then display it. Then reallocate memory for the same pointer variable, input elements, display it and then free the memory\u003c/a\u003e\u003cbr /\u003e\n\u003cdiv class\u003d\"mokcode\"\u003e\u003cpre\u003e\u003cspan style\u003d\"color: blue;\"\u003e#include\u0026lt;stdio.h\u0026gt;\n#include\u0026lt;conio.h\u0026gt; \u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e// Linux user - Remove this\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n#include\u0026lt;stdlib.h\u0026gt;\n\nint main()\n{\n    int *ptr,n,i;\n    printf(\"Enter number of elements : \");\n    scanf(\"%d\",\u0026amp;n);\n    \n    // Allocating memory dynamically\n    ptr\u003d(int *)malloc(n*sizeof(int));\n    \n    // Inputing elements\n    printf(\"Enter Elements : \");\n    for(i\u003d0;i\u0026lt;n;i++)\n    {\n    scanf(\"%d\",(ptr+i));\n }\n    \n    // Displaying elements\n    printf(\"Entered elements : \");\n    for(i\u003d0;i\u0026lt;n;i++)\n    {\n    printf(\"%d \",*(ptr+i));\n }\n \n printf(\"\\nEnter number of elements : \");\n    scanf(\"%d\",\u0026amp;n);\n    \n    // Reallocating memory \n ptr\u003drealloc(ptr,n);\n \n // Inputing elements\n    printf(\"Enter Elements : \");\n    for(i\u003d0;i\u0026lt;n;i++)\n    {\n    scanf(\"%d\",(ptr+i));\n }\n    \n    // Displaying elements\n    printf(\"Entered elements : \");\n    for(i\u003d0;i\u0026lt;n;i++)\n    {\n    printf(\"%d \",*(ptr+i));\n }\n \n // Deallocating memory\n free(ptr);\n    \n    getch(); \u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e// Linux user - Remove this\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n    return 0;\n}\u003c/span\u003e\n\u003c/pre\u003e\u003c/div\u003e\u003cbr /\u003e\n\u003ca href\u003d\"http://www.comp-psyche.com/2014/01/c-programs-dma.html#p4\" name\u003d\"p4\"\u003e4. Program to find the length of the string\u003c/a\u003e\u003cbr /\u003e\n\u003cdiv class\u003d\"mokcode\"\u003e\u003cpre\u003e\u003cspan style\u003d\"color: blue;\"\u003e#include\u0026lt;stdio.h\u0026gt;\n#include\u0026lt;conio.h\u0026gt; \u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e// Linux user - Remove this\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n#include\u0026lt;stdlib.h\u0026gt;\nvoid main()\n{\n char *ptr;\n \n // Declaring variable i\u003dto iterate loop, l\u003dlenght of string\n int i, l\u003d0;\n \n    // Allocating memory\n ptr\u003d(char *)malloc(12*sizeof(char));\n \n // Inputing string\n printf(\"Enter string : \");\n gets(ptr);\n \n // Displaying string\n printf(\"Entered string : \");\n puts(ptr);\n \n // Calculating length\n while(ptr[l]!\u003d'\\0')\n {\n l++;\n }\n \n // Printing length of string\n printf(\"Lenght of string : %d\",l);\n \n // Deallocating memory\n free(ptr);\n \n getch(); \u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e// Linux user - Remove this\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n\u003c/span\u003e\u003cspan style\u003d\"color: blue;\"\u003e\n return 0;\n}\u003c/span\u003e\n\u003c/pre\u003e\u003c/div\u003e\u003cbr /\u003e\n\u003c/div\u003e"},"link":[{"rel":"replies","type":"application/atom+xml","href":"https://www.comp-psyche.com/feeds/6914796806847001338/comments/default","title":"Post Comments"},{"rel":"replies","type":"text/html","href":"https://www.comp-psyche.com/2014/01/c-programs-dma.html#comment-form","title":"0 Comments"},{"rel":"edit","type":"application/atom+xml","href":"https://www.blogger.com/feeds/8285804830535272268/posts/default/6914796806847001338"},{"rel":"self","type":"application/atom+xml","href":"https://www.blogger.com/feeds/8285804830535272268/posts/default/6914796806847001338"},{"rel":"alternate","type":"text/html","href":"https://www.comp-psyche.com/2014/01/c-programs-dma.html","title":"C PROGRAMS : DYNAMIC MEMORY ALLOCATION"}],"author":[{"name":{"$t":"Mantu Kumar"},"uri":{"$t":"https://www.blogger.com/profile/02897308282659594376"},"email":{"$t":"noreply@blogger.com"},"gd$image":{"rel":"http://schemas.google.com/g/2005#thumbnail","width":"35","height":"35","src":"//www.blogger.com/img/blogger_logo_round_35.png"}}],"thr$total":{"$t":"0"}}]}});