Search yourself!

Hello geeks! It has been a long time since our last post, so here’s another very easy and interesting topic to enjoy, ‘Searching’! Linear Search Linear search also called as sequential search, is the simplest way to search an element from a given list. It is this search technique which you use almost everywhere inContinue reading “Search yourself!”

Sorting logged!

Hello Geeks! In the previous post we had discussed the three basic sorting techniques: bubble sort, selection sort and insertion sort. In today’s post we shall discuss two much more efficient sorting techniques: “Merge sort” and “Quick sort”. So lets get started! Merge Sort Merge sort is a simple divide-and-conquer algorithm, which involves breaking downContinue reading “Sorting logged!”

Divide and Conquer

“Divide each difficulty into as many parts as is feasible and necessary to resolve it.” -Rene Descarts This quote aptly describes what is the logic and thinking behind divide and conquer !!So join us in learning this very important concept, which will meet you again in the next post also! Divide and Conquer is anContinue reading “Divide and Conquer”

Sorting Squared!

Ever wanted to sort out the books in your library at home? Or even the money in your purse? Then sorting comes your way!  Sorting is a method of arranging items in a particular format. A list of items can be sorted in a number of ways in based upon various parameters, for instance, a numeric listContinue reading “Sorting Squared!”

Quiz Time!

Want to know how well you can print patterns? Or why time and space complexity is really that intriguing? Then here is a set of tricky and intresting patterns, and complexity based questions to ponder upon! Q(1-4) Write the looping conditions for these programs ! 1.Pattern 1 : 2.Pattern 2: 3. Pattern 3: 4. PatternContinue reading “Quiz Time!”

Space and Time Complexity

Survival of the Fittest, is commonly used to denote progress measured by ‘strength’ or ‘success’. If we think about it, the phrase is applicable to programming too. We are often unaware of what goes on behind our program during its compilation. There may be more than one way to solve a problem, we need toContinue reading “Space and Time Complexity”

Hello World!

Hello World! Sometimes a simple ‘Hello’ can lead you to a million awesome things! Here is one such Hello! BitXorBytes brings to you a collection of geeky articles based mostly on Computer science and Programming! There would be tonnes of cool resources, such as ‘Algorithm Explanations’, ‘World’s Firsts’, ‘Interesting Facts and discoveries’, ‘Monthly quizzes’, ‘BulletinContinue reading “Hello World!”

Design a site like this with WordPress.com
Get started