ALGO 16 | ARRAY COUNTING AND HISTOGRAMMING | PROBLEM SOLVING TECHNIQUES

In This video I have discussed the Algorithm "Array counting and histogramming" where I have explained about how the elements of the array can be counted and displayed. In this Series " Problem Solving Techniques " we will Discuss most of basic algorithms and their working with the help of examples. List of Algorithms which are going to be discussed in the coming sessions are 1. Exchanging the values of two variables 2. Counting 3. Summation of a set of numbers 4. Factorial computation 5. Generating the Fibonacci series 6. Reversing the digits of an integer 7. Character to number conversion 8. Finding square root of a number 9. Finding the smallest divisor of an integer 10. The greatest common divisor of two integers 11. Generation of prime numbers 12. Computing the prime factors of an integer 13. Generation of pseudorandom numbers 14. Raising a number to our largest power 15. Array order reversal 16. Array counting or histograming 17. Finding the maximum number in a set 18. To remove duplicate from an ordered array 19. Partitioning an array 20. Finding the K, the smallest element 21. Multiplication of two matrices 22. Merging 23. Sorting Selection sort 24. sorting by exchange. Bubble sort 25. Sorting by insertion insertion sort 26. Sorting by diminishing increment. Shell sort 27. Sorting by partitioning. Quick sort 28. Linear search 29. Binary search 30. Hash search 31. Text line, length adjustment 32. Keyword searching in text, pattern searching 33. Text line editing 34. Linear pattern searching. KMP, pattern searching algorithm #computer #pst #problemsolvingmethods #problemsolvingtechniques #algorithm #smallestdivisor #bca #mca #nep #sep