1(self.webpackChunk_N_E=self.webpackChunk_N_E||[]).push([[23],{7530:function(e,i,s){(window.__NEXT_P=window.__NEXT_P||[]).push(["/thank-you",function(){return s(9632)}])},9632:function(e,i,s){"use strict";s.r(i);var t=s(5893),n=(s(7294),s(9008));i.default=function(){return(0,t.jsxs)(t.Fragment,{children:[(0,t.jsx)(n.default,{children:(0,t.jsx)("title",{children:"Thank You"})}),(0,t.jsxs)("main",{id:"home",className:"thank-you container h-screen pt-3",children:[(0,t.jsx)("h1",{className:"text-center text-2xl font-bold md:text-4xl",children:"Thank You"}),(0,t.jsxs)("p",{className:"mt-2",children:["Special thanks to"," ",(0,t.jsx)("a",{href:"https://github.com/Hussein-miracle",children:"Hussein Abdullahi"})," for making the project a success and also many other Open Source Projects."]}),(0,t.jsxs)("div",{className:"mt-5",children:[(0,t.jsx)("h2",{className:"center text-2xl font-bold",children:"Credit to Open Source Projects used in this project."}),(0,t.jsxs)("div",{children:[(0,t.jsxs)("li",{children:[(0,t.jsx)("a",{href:"https://github.com/MartinDevillers/omicron/",children:"Omicron (Big O(micron) Visualizer) - Martin Devillers"}),": helped by giving the idea to represent time complexities using charts"]}),(0,t.jsxs)("li",{children:[(0,t.jsx)("a",{href:"https://github.com/ashwin-athappan/algo-visualizer",children:"Algo Visualizer"})," ","by"," ",(0,t.jsx)("a",{href:"https://github.com/ashwin-athappan",children:"Ashwin Athappan"})," ","which helped in visualizing the Graph Traversal algorithms"]}),(0,t.jsxs)("li",{children:[(0,t.jsx)("a",{href:"https://github.com/ashwin-athappan/Sorting-Visualizer-3D/tree/CODE",children:"Sorting-Visualizer-3D"})," ","by"," ",(0,t.jsx)("a",{href:"https://github.com/ashwin-athappan",children:"Ashwin Athappan"})," ","helped for the sorting algorithms"]}),(0,t.jsx)("li",{children:"Lots more..."})]})]})]})]})}},9008:function(e,i,s){e.exports=s(5443)}},function(e){e.O(0,[774,888,179],(function(){return i=7530,e(e.s=i);var i}));var i=e.O();_N_E=i}]);
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.