How to find Best 3 in Excel || Find SUM, AVERAGE of Best 3,4,n.. value || #LARGE​ #ROUND​ in MS Excel

-


How to find Best 3 in Excel || Find SUM, AVERAGE of Best 3,4,n.. value || #LARGE​ #ROUND​ in MS Excel


Comments

Post a Comment

Popular posts from this blog

How to make WiFi hotspot in windows 10 using Mobile hotspot Creation tool || Make WIFI Hotspot

-
Image
  How to make WiFi hotspot in windows 10 using Mobile hotspot Creation tool || Make WIFI Hotspot #Hotspot #Windown10Hotspot #TechFunLearning To create Wi-Fi hotspot in windows 10, one is using CMD method and other one is directly through windows 10 hotspot creation tool under network & Internet settings. 1. COMMAND Method: Go with my recent video link given below. https://www.youtube.com/watch?v=9ry-nxrpfPs 2. Hotspot creation tool under network & Internet settings: Go to start menu then click on Setting icon. Here click on Network & Internet then from the left side navigation click on Mobile Hotspot. Now turn on option Share my internet connection with other devices under the Mobile Hotspot Note: Max number of 8 devices can be connected with the system. Both the methods work well and are easy to use. Should you face any issue or have any query in creating the Wi-Fi hotspot in windows 10, please feel free to write your query in comments below. You can also...
Read more

Binary Search Tree: C Program to implement a Binary Search Tree and perform deletion, inorder traversal on it

-
Image
Binary Search Tree C Program to implement a Binary Search Tree and perform deletion, inorder traversal on it     #include <stdio.h>     #include <stdlib.h>           struct btnode     {         int value;         struct btnode *l;         struct btnode *r;     }*root = NULL, *temp = NULL, *t2, *t1;           void delete1();     void insert();     void delete();     void inorder(struct btnode *t);     void create();     void search(struct btnode *t);     void preorder(struct btnode *t);     void postorder(struct btnode *t);     void search1(struct btnode *t,int data);     int smallest(struct btnode *t);     int largest(struct btnode *t);     void main()     {         int ch;     ...
Read more