Unity3D - Prefab Manager

Introduction

After spending some years in Game Industry, I realize managing prefabs and make them pool is a major and necessary module of each game.

As, instantiating and destroying calls are really expensive at runtime. So, due to this, it is better to pool instantiated objects and recycle them after use, for future.

Purpose

In Unity projects, programmers have to instantiate and destroy various GameObjects at runtime like enemies, particles, powerups, health boxes etc. So, it is better to pool them and recycle them.

Unity Asset Store Link 

http://u3d.as/UkT 

GitHub Link

https://github.com/mohsinkhan26/PrefabManager

Features

• Easily pool GameObjects in your game
• Promotes the use of pooling concept
• Auto scale your pool
• Prefab manager to spawn and recycle
• Improve the performance of your game
• Place prefabs anywhere in Assets/ and just place a reference in PrefabManager
• Maintains hierarchy under PrefabManager
• Select when you want to create your pool on Awake, Start or Manually
• Still you can update the data of the newly spawned objects
• Easy to use, Plug n play
• Open Source code without any DLL

Binary Search Tree - Code

Binary Search Tree

The following C++ code will explains the implementation of Binary Search Tree.
The following implementation is in object oriented using the Tree class and tree object. 
The implemented ADT functions of Binary Search Tree are insert and search.

Double Link List

Double Link List 

The following C++ code will explains the implementation of Double Link List.

The following implementation is in object oriented using the DoubleLinkList class and dll object. The implemented ADT functions of Double Link List are insert, print, search, modify and delete.

Single Link List

Single Link List

The following C++ code will explains the implementation of Single Link List.

The following implementation is in object oriented using the SingleLinkList class and sll object. The implemented ADT functions of Single Link List are insert, print, search, modify and delete.

Merge Sort

Merge Sort 

The following C++ code will explains the implementation of Merge Sort and sort the user input numbers in descending order.

The following implementation is in object oriented using the MergeSort class and ms object. Actual logic of Merge sort is in the function of Merge().

Bubble Sort

Bubble Sort

The following C++ code will explains the implementation of Bubble sort and sort the user input numbers in descending order.
The following implementation is in object oriented using the BubbleSort class and bs object. Actual logic of Bubble sort is in the function of BSort(). 

Linear Searching

Linear Searching 

The following C++ code will explains the implementation of Linear Searching and sort the user input numbers in descending order.

The following implementation is in object oriented using the LinearSearching class and ls object. Actual logic of Linear Searching is in the function of LSearching().
Remember in Linear Searching, bubble sort is used to sort the data and to search in the sorted data Linear Searching is used.

General Searching

General Searching 

The following C++ code will explains the implementation of General Searching and sort the user input numbers in descending order.

The following implementation is in object oriented using the GeneralSearching class and gs object. Actual logic of General Searching is in the function of GSearching(). 
Remember in General Searching, bubble sort is used to sort the data and to search in the sorted data General Searching is used.