If you want to check if your linked list is circular you can use Floyd’s Cycle-Finding Algorithm aka Tortoise and the Hare Algorithm.
It’s quite efficient as It has O(n) complexity.
Continue reading
Floyd’s Cycle-Finding Algorithm
Reply
Category Archives: Development
Algorithms: Binary tree
Simple implementation of binary tree in C++ Continue reading
Share it with your friends:
Algorithms: CRC16
Simple implemetation of 16bit Cyclic Redundancy Check (CRC16) in C++ Continue reading
Share it with your friends:
Algorithms: Queue
Simple implementation of Queue with exception handling in C++ using templates Continue reading
Share it with your friends:
Algorithms: Stack
Simple implementation of Stack with exception handling in C++ using templates Continue reading
Share it with your friends:
Algorithms: Two-way linked list
Simple implementation of Two-way linked list in C++ Continue reading
Share it with your friends:
Create new batch characteristics with values checked and suggested by a function module
In this example I’ll try to show you how to create new characteristics for a material batch. This will include the following steps:
- Creation of a function module to check characteristics value (optional)
- Creation of a function module to suggest characteristics value – search help (optional)
- Creation of new characteristics (CT04)
- Creation/modification of a class (CL02)
- Object/Class assignment to a class (CL24N or CL20N and OMS2 if necessary)
- Batch modification with our new characteristics (MCS2N)
Share it with your friends:
How to maintain text IDs in SAP
If you want to create new text ID that will be available in SO10 transaction, then follow these easy steps below. Continue reading
Share it with your friends:
ALV tutorial 10 – Pushbuttons and Hyperlinks in cells
Pushbuttons and hyperlinks in ALV fields Continue reading
Share it with your friends:
ALV tutorial 09 – Dropdown lists
Example of setting an ALV column as dropdown listbox. Continue reading
